./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/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_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/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_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/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 c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- 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:34:57,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 05:34:57,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 05:34:57,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 05:34:57,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 05:34:57,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 05:34:57,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 05:34:57,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 05:34:57,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 05:34:57,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 05:34:57,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 05:34:57,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 05:34:57,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 05:34:57,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 05:34:57,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 05:34:57,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 05:34:57,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 05:34:57,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 05:34:57,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 05:34:57,873 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 05:34:57,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 05:34:57,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 05:34:57,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 05:34:57,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 05:34:57,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 05:34:57,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 05:34:57,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 05:34:57,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 05:34:57,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 05:34:57,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 05:34:57,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 05:34:57,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 05:34:57,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 05:34:57,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 05:34:57,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 05:34:57,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 05:34:57,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 05:34:57,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 05:34:57,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 05:34:57,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 05:34:57,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 05:34:57,886 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 05:34:57,901 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 05:34:57,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 05:34:57,901 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 05:34:57,901 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 05:34:57,902 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 05:34:57,902 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 05:34:57,902 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 05:34:57,902 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 05:34:57,902 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 05:34:57,903 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 05:34:57,903 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 05:34:57,903 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 05:34:57,903 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 05:34:57,904 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 05:34:57,904 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 05:34:57,904 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 05:34:57,904 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 05:34:57,904 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 05:34:57,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 05:34:57,906 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 05:34:57,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 05:34:57,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 05:34:57,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 05:34:57,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 05:34:57,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 05:34:57,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 05:34:57,907 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 05:34:57,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 05:34:57,908 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 05:34:57,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 05:34:57,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 05:34:57,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 05:34:57,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:34:57,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 05:34:57,908 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 05:34:57,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 05:34:57,909 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 05:34:57,909 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 05:34:57,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 05:34:57,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 05:34:57,909 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 05:34:57,909 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_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/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_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2022-12-14 05:34:58,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 05:34:58,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 05:34:58,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 05:34:58,104 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 05:34:58,104 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 05:34:58,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/heap-manipulation/dancing.i [2022-12-14 05:35:00,753 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 05:35:00,944 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 05:35:00,945 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/sv-benchmarks/c/heap-manipulation/dancing.i [2022-12-14 05:35:00,961 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/data/112227e6c/57fb4dda1f44407eba096d368fb1a1e5/FLAG0be432771 [2022-12-14 05:35:00,974 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/data/112227e6c/57fb4dda1f44407eba096d368fb1a1e5 [2022-12-14 05:35:00,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 05:35:00,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 05:35:00,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 05:35:00,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 05:35:00,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 05:35:00,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:35:00" (1/1) ... [2022-12-14 05:35:00,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e861108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:35:00, skipping insertion in model container [2022-12-14 05:35:00,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:35:00" (1/1) ... [2022-12-14 05:35:00,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 05:35:01,013 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 05:35:01,145 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_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-12-14 05:35:01,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:35:01,228 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 05:35:01,237 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_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2022-12-14 05:35:01,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:35:01,272 INFO L208 MainTranslator]: Completed translation [2022-12-14 05:35:01,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:35:01 WrapperNode [2022-12-14 05:35:01,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 05:35:01,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 05:35:01,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 05:35:01,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 05:35:01,279 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:35:01" (1/1) ... [2022-12-14 05:35:01,287 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:35:01" (1/1) ... [2022-12-14 05:35:01,302 INFO L138 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-12-14 05:35:01,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 05:35:01,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 05:35:01,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 05:35:01,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 05:35:01,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:35:01" (1/1) ... [2022-12-14 05:35:01,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:35:01" (1/1) ... [2022-12-14 05:35:01,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:35:01" (1/1) ... [2022-12-14 05:35:01,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:35:01" (1/1) ... [2022-12-14 05:35:01,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:35:01" (1/1) ... [2022-12-14 05:35:01,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:35:01" (1/1) ... [2022-12-14 05:35:01,320 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:35:01" (1/1) ... [2022-12-14 05:35:01,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:35:01" (1/1) ... [2022-12-14 05:35:01,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 05:35:01,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 05:35:01,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 05:35:01,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 05:35:01,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:35:01" (1/1) ... [2022-12-14 05:35:01,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:35:01,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:35:01,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 05:35:01,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 05:35:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-12-14 05:35:01,375 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-12-14 05:35:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 05:35:01,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 05:35:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 05:35:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 05:35:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 05:35:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 05:35:01,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 05:35:01,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 05:35:01,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 05:35:01,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 05:35:01,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 05:35:01,466 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 05:35:01,468 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 05:35:01,659 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 05:35:01,752 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 05:35:01,752 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 05:35:01,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:35:01 BoogieIcfgContainer [2022-12-14 05:35:01,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 05:35:01,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 05:35:01,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 05:35:01,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 05:35:01,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:35:00" (1/3) ... [2022-12-14 05:35:01,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730f47b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:35:01, skipping insertion in model container [2022-12-14 05:35:01,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:35:01" (2/3) ... [2022-12-14 05:35:01,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730f47b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:35:01, skipping insertion in model container [2022-12-14 05:35:01,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:35:01" (3/3) ... [2022-12-14 05:35:01,763 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-12-14 05:35:01,777 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 05:35:01,778 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 05:35:01,813 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 05:35:01,818 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;@74870c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 05:35:01,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 05:35:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 05:35:01,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 05:35:01,828 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:35:01,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:35:01,829 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:35:01,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:35:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1960236528, now seen corresponding path program 1 times [2022-12-14 05:35:01,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:35:01,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865107561] [2022-12-14 05:35:01,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:35:01,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:35:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:35:02,093 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:35:02,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:35:02,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865107561] [2022-12-14 05:35:02,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865107561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:35:02,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:35:02,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 05:35:02,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609033459] [2022-12-14 05:35:02,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:35:02,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:35:02,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:35:02,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:35:02,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:35:02,124 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:35:02,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:35:02,231 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-12-14 05:35:02,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:35:02,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-12-14 05:35:02,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:35:02,241 INFO L225 Difference]: With dead ends: 51 [2022-12-14 05:35:02,241 INFO L226 Difference]: Without dead ends: 31 [2022-12-14 05:35:02,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:35:02,247 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:35:02,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 100 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:35:02,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-14 05:35:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-12-14 05:35:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 05:35:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-12-14 05:35:02,299 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 13 [2022-12-14 05:35:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:35:02,301 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-12-14 05:35:02,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:35:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-12-14 05:35:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 05:35:02,302 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:35:02,302 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:35:02,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 05:35:02,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:35:02,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:35:02,304 INFO L85 PathProgramCache]: Analyzing trace with hash -990337553, now seen corresponding path program 1 times [2022-12-14 05:35:02,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:35:02,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201657841] [2022-12-14 05:35:02,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:35:02,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:35:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:35:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 05:35:02,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:35:02,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201657841] [2022-12-14 05:35:02,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201657841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:35:02,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:35:02,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 05:35:02,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531203541] [2022-12-14 05:35:02,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:35:02,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:35:02,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:35:02,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:35:02,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:35:02,391 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 05:35:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:35:02,464 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-12-14 05:35:02,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:35:02,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-12-14 05:35:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:35:02,465 INFO L225 Difference]: With dead ends: 59 [2022-12-14 05:35:02,465 INFO L226 Difference]: Without dead ends: 40 [2022-12-14 05:35:02,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:35:02,467 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:35:02,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 80 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:35:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-14 05:35:02,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-12-14 05:35:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-14 05:35:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-12-14 05:35:02,472 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 19 [2022-12-14 05:35:02,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:35:02,473 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-12-14 05:35:02,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 05:35:02,473 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-12-14 05:35:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 05:35:02,473 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:35:02,474 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:35:02,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 05:35:02,474 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:35:02,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:35:02,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1915617284, now seen corresponding path program 1 times [2022-12-14 05:35:02,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:35:02,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241893706] [2022-12-14 05:35:02,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:35:02,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:35:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:35:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:35:02,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:35:02,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241893706] [2022-12-14 05:35:02,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241893706] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:35:02,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305493308] [2022-12-14 05:35:02,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:35:02,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:35:02,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:35:02,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:35:02,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 05:35:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:35:02,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 05:35:02,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:35:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:35:02,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:35:02,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305493308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:35:02,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:35:02,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 11 [2022-12-14 05:35:02,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742820924] [2022-12-14 05:35:02,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:35:02,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 05:35:02,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:35:02,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 05:35:02,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-14 05:35:02,909 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 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:35:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:35:03,206 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2022-12-14 05:35:03,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 05:35:03,207 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 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 21 [2022-12-14 05:35:03,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:35:03,210 INFO L225 Difference]: With dead ends: 78 [2022-12-14 05:35:03,210 INFO L226 Difference]: Without dead ends: 59 [2022-12-14 05:35:03,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-12-14 05:35:03,212 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 50 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:35:03,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 95 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:35:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-12-14 05:35:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2022-12-14 05:35:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (16), 9 states have call predecessors, (16), 11 states have call successors, (16) [2022-12-14 05:35:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2022-12-14 05:35:03,227 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 21 [2022-12-14 05:35:03,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:35:03,227 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2022-12-14 05:35:03,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 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:35:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2022-12-14 05:35:03,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 05:35:03,229 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:35:03,229 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:35:03,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 05:35:03,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:35:03,431 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:35:03,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:35:03,433 INFO L85 PathProgramCache]: Analyzing trace with hash -550540788, now seen corresponding path program 1 times [2022-12-14 05:35:03,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:35:03,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751039076] [2022-12-14 05:35:03,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:35:03,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:35:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:35:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:35:03,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:35:03,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751039076] [2022-12-14 05:35:03,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751039076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:35:03,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:35:03,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 05:35:03,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642908471] [2022-12-14 05:35:03,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:35:03,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:35:03,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:35:03,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:35:03,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:35:03,690 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 3 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:35:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:35:03,811 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2022-12-14 05:35:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:35:03,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 3 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 22 [2022-12-14 05:35:03,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:35:03,813 INFO L225 Difference]: With dead ends: 75 [2022-12-14 05:35:03,813 INFO L226 Difference]: Without dead ends: 50 [2022-12-14 05:35:03,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:35:03,815 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:35:03,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 79 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:35:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-12-14 05:35:03,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-12-14 05:35:03,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) [2022-12-14 05:35:03,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2022-12-14 05:35:03,822 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 22 [2022-12-14 05:35:03,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:35:03,822 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2022-12-14 05:35:03,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 3 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:35:03,823 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2022-12-14 05:35:03,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 05:35:03,823 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:35:03,823 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:35:03,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 05:35:03,824 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:35:03,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:35:03,824 INFO L85 PathProgramCache]: Analyzing trace with hash 622387022, now seen corresponding path program 1 times [2022-12-14 05:35:03,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:35:03,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3175747] [2022-12-14 05:35:03,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:35:03,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:35:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:35:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:35:03,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:35:03,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3175747] [2022-12-14 05:35:03,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3175747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:35:03,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:35:03,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 05:35:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223925603] [2022-12-14 05:35:03,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:35:03,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:35:03,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:35:03,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:35:03,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:35:03,947 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 05:35:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:35:04,048 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2022-12-14 05:35:04,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:35:04,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-12-14 05:35:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:35:04,049 INFO L225 Difference]: With dead ends: 56 [2022-12-14 05:35:04,049 INFO L226 Difference]: Without dead ends: 49 [2022-12-14 05:35:04,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:35:04,050 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:35:04,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:35:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-14 05:35:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-12-14 05:35:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 34 states have internal predecessors, (40), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2022-12-14 05:35:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2022-12-14 05:35:04,056 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 24 [2022-12-14 05:35:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:35:04,057 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2022-12-14 05:35:04,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 05:35:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2022-12-14 05:35:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:35:04,058 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:35:04,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:35:04,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 05:35:04,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:35:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:35:04,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1814955922, now seen corresponding path program 1 times [2022-12-14 05:35:04,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:35:04,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344260741] [2022-12-14 05:35:04,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:35:04,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:35:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:35:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 05:35:04,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:35:04,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344260741] [2022-12-14 05:35:04,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344260741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:35:04,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:35:04,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 05:35:04,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003048881] [2022-12-14 05:35:04,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:35:04,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 05:35:04,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:35:04,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 05:35:04,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:35:04,177 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 05:35:04,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:35:04,316 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2022-12-14 05:35:04,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 05:35:04,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-12-14 05:35:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:35:04,318 INFO L225 Difference]: With dead ends: 61 [2022-12-14 05:35:04,318 INFO L226 Difference]: Without dead ends: 59 [2022-12-14 05:35:04,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 05:35:04,320 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:35:04,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 167 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:35:04,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-12-14 05:35:04,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2022-12-14 05:35:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 40 states have internal predecessors, (45), 12 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (20), 9 states have call predecessors, (20), 11 states have call successors, (20) [2022-12-14 05:35:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2022-12-14 05:35:04,328 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 23 [2022-12-14 05:35:04,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:35:04,329 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2022-12-14 05:35:04,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 05:35:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2022-12-14 05:35:04,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 05:35:04,330 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:35:04,330 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:35:04,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 05:35:04,330 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:35:04,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:35:04,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1869846354, now seen corresponding path program 1 times [2022-12-14 05:35:04,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:35:04,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234617476] [2022-12-14 05:35:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:35:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:35:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:35:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:35:04,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:35:04,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234617476] [2022-12-14 05:35:04,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234617476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:35:04,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:35:04,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 05:35:04,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698681858] [2022-12-14 05:35:04,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:35:04,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:35:04,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:35:04,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:35:04,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:35:04,425 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 05:35:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:35:04,528 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2022-12-14 05:35:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:35:04,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-12-14 05:35:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:35:04,530 INFO L225 Difference]: With dead ends: 94 [2022-12-14 05:35:04,530 INFO L226 Difference]: Without dead ends: 54 [2022-12-14 05:35:04,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:35:04,532 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:35:04,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 70 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:35:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-12-14 05:35:04,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-12-14 05:35:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 39 states have internal predecessors, (43), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (18), 9 states have call predecessors, (18), 10 states have call successors, (18) [2022-12-14 05:35:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2022-12-14 05:35:04,539 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 25 [2022-12-14 05:35:04,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:35:04,540 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2022-12-14 05:35:04,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 05:35:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2022-12-14 05:35:04,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 05:35:04,540 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:35:04,541 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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:35:04,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 05:35:04,541 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:35:04,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:35:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash -782544633, now seen corresponding path program 1 times [2022-12-14 05:35:04,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:35:04,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039570284] [2022-12-14 05:35:04,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:35:04,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:35:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:35:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 05:35:04,645 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:35:04,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039570284] [2022-12-14 05:35:04,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039570284] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:35:04,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239746038] [2022-12-14 05:35:04,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:35:04,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:35:04,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:35:04,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:35:04,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 05:35:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:35:04,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 05:35:04,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:35:04,808 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-12-14 05:35:04,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-12-14 05:35:04,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2022-12-14 05:35:04,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2022-12-14 05:35:04,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 25 [2022-12-14 05:35:04,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:35:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 05:35:04,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:35:05,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:35:05,076 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 124 treesize of output 127 [2022-12-14 05:35:05,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 128 [2022-12-14 05:35:05,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 124 [2022-12-14 05:35:05,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-14 05:35:05,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-12-14 05:35:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:35:05,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239746038] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:35:05,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [543198672] [2022-12-14 05:35:05,173 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-12-14 05:35:05,173 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:35:05,176 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:35:05,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:35:05,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 14 [2022-12-14 05:35:05,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826866308] [2022-12-14 05:35:05,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:35:05,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 05:35:05,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:35:05,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 05:35:05,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-12-14 05:35:05,179 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-14 05:35:07,197 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:35:09,321 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:35:11,358 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:35:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:35:11,438 INFO L93 Difference]: Finished difference Result 116 states and 152 transitions. [2022-12-14 05:35:11,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 05:35:11,438 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 29 [2022-12-14 05:35:11,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:35:11,439 INFO L225 Difference]: With dead ends: 116 [2022-12-14 05:35:11,439 INFO L226 Difference]: Without dead ends: 67 [2022-12-14 05:35:11,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-12-14 05:35:11,440 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:35:11,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 149 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 158 Invalid, 3 Unknown, 0 Unchecked, 6.2s Time] [2022-12-14 05:35:11,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-14 05:35:11,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-12-14 05:35:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 47 states have internal predecessors, (50), 12 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (20), 10 states have call predecessors, (20), 11 states have call successors, (20) [2022-12-14 05:35:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2022-12-14 05:35:11,454 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 29 [2022-12-14 05:35:11,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:35:11,454 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2022-12-14 05:35:11,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-14 05:35:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2022-12-14 05:35:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 05:35:11,455 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:35:11,455 INFO L195 NwaCegarLoop]: trace histogram [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:35:11,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 05:35:11,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 05:35:11,657 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:35:11,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:35:11,659 INFO L85 PathProgramCache]: Analyzing trace with hash 163127043, now seen corresponding path program 1 times [2022-12-14 05:35:11,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:35:11,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231498931] [2022-12-14 05:35:11,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:35:11,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:35:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:35:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:35:11,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:35:11,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231498931] [2022-12-14 05:35:11,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231498931] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:35:11,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671061307] [2022-12-14 05:35:11,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:35:11,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:35:11,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:35:11,837 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:35:11,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 05:35:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:35:11,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 05:35:11,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:35:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:35:11,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:35:12,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:35:12,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671061307] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:35:12,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1605350897] [2022-12-14 05:35:12,123 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-12-14 05:35:12,123 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:35:12,123 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:35:12,127 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:35:12,128 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:35:12,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-12-14 05:35:12,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 05:35:12,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,190 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:35:12,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-12-14 05:35:12,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-12-14 05:35:12,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 05:35:12,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,258 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 05:35:12,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2022-12-14 05:35:12,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-12-14 05:35:12,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:35:12,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 39 [2022-12-14 05:35:12,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 37 [2022-12-14 05:35:12,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:35:12,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 39 [2022-12-14 05:35:12,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,415 INFO L321 Elim1Store]: treesize reduction 52, result has 36.6 percent of original size [2022-12-14 05:35:12,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2022-12-14 05:35:12,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,479 INFO L321 Elim1Store]: treesize reduction 72, result has 35.7 percent of original size [2022-12-14 05:35:12,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 73 [2022-12-14 05:35:12,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:35:12,539 INFO L321 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-12-14 05:35:12,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2022-12-14 05:35:12,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:35:12,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:35:12,556 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 05:35:12,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-14 05:35:12,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:35:12,580 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 05:35:12,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2022-12-14 05:35:12,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 05:35:12,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2022-12-14 05:35:12,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:35:12,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:35:12,627 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 05:35:12,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-14 05:35:12,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:35:12,646 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 05:35:12,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2022-12-14 05:35:12,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:35:12,676 INFO L321 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-12-14 05:35:12,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2022-12-14 05:35:12,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,840 INFO L321 Elim1Store]: treesize reduction 62, result has 34.7 percent of original size [2022-12-14 05:35:12,841 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 133 treesize of output 112 [2022-12-14 05:35:12,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:12,889 INFO L321 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2022-12-14 05:35:12,889 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 106 treesize of output 91 [2022-12-14 05:35:12,902 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 15 treesize of output 1 [2022-12-14 05:35:12,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 1 [2022-12-14 05:35:12,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:13,093 INFO L321 Elim1Store]: treesize reduction 162, result has 45.5 percent of original size [2022-12-14 05:35:13,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 246 treesize of output 300 [2022-12-14 05:35:13,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:35:13,210 INFO L321 Elim1Store]: treesize reduction 104, result has 43.8 percent of original size [2022-12-14 05:35:13,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 361 treesize of output 296 [2022-12-14 05:36:09,280 INFO L321 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-12-14 05:36:09,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 85 [2022-12-14 05:36:09,326 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-12-14 05:36:09,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 103 [2022-12-14 05:36:09,334 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 33 treesize of output 1 [2022-12-14 05:36:09,354 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 39 treesize of output 1 [2022-12-14 05:36:09,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:36:09,510 INFO L321 Elim1Store]: treesize reduction 134, result has 48.3 percent of original size [2022-12-14 05:36:09,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 184 treesize of output 232 [2022-12-14 05:36:09,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:36:09,636 INFO L321 Elim1Store]: treesize reduction 102, result has 53.0 percent of original size [2022-12-14 05:36:09,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 243 treesize of output 285 [2022-12-14 05:38:48,605 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2022-12-14 05:38:48,614 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 12 for LOIs [2022-12-14 05:38:48,629 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:38:59,975 WARN L233 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 1192 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:39:00,101 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1827#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 05:39:00,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 05:39:00,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:39:00,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 8 [2022-12-14 05:39:00,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232318557] [2022-12-14 05:39:00,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:39:00,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 05:39:00,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:39:00,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 05:39:00,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2022-12-14 05:39:00,103 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 05:39:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:39:00,240 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-12-14 05:39:00,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 05:39:00,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-12-14 05:39:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:39:00,241 INFO L225 Difference]: With dead ends: 83 [2022-12-14 05:39:00,241 INFO L226 Difference]: Without dead ends: 53 [2022-12-14 05:39:00,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2022-12-14 05:39:00,242 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:39:00,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 82 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:39:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-14 05:39:00,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2022-12-14 05:39:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-12-14 05:39:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-12-14 05:39:00,249 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 27 [2022-12-14 05:39:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:39:00,250 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-12-14 05:39:00,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 05:39:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-12-14 05:39:00,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 05:39:00,250 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:39:00,250 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 05:39:00,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 05:39:00,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:39:00,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:39:00,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:39:00,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1864603018, now seen corresponding path program 1 times [2022-12-14 05:39:00,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:39:00,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738481630] [2022-12-14 05:39:00,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:39:00,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:39:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:39:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 05:39:00,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:39:00,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738481630] [2022-12-14 05:39:00,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738481630] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:39:00,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021782774] [2022-12-14 05:39:00,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:39:00,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:39:00,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:39:00,585 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:39:00,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 05:39:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:39:00,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 05:39:00,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:39:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 05:39:00,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:39:00,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021782774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:39:00,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:39:00,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-12-14 05:39:00,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969168062] [2022-12-14 05:39:00,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:39:00,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:39:00,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:39:00,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:39:00,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-14 05:39:00,756 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-14 05:39:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:39:00,887 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-12-14 05:39:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 05:39:00,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-12-14 05:39:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:39:00,888 INFO L225 Difference]: With dead ends: 58 [2022-12-14 05:39:00,888 INFO L226 Difference]: Without dead ends: 48 [2022-12-14 05:39:00,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-14 05:39:00,889 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:39:00,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:39:00,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-12-14 05:39:00,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2022-12-14 05:39:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.206896551724138) internal successors, (35), 33 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-12-14 05:39:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-12-14 05:39:00,896 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 34 [2022-12-14 05:39:00,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:39:00,896 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-12-14 05:39:00,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-14 05:39:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-12-14 05:39:00,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 05:39:00,897 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:39:00,897 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:39:00,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 05:39:01,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 05:39:01,098 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:39:01,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:39:01,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1826310404, now seen corresponding path program 1 times [2022-12-14 05:39:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:39:01,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027503709] [2022-12-14 05:39:01,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:39:01,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:39:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:39:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 05:39:01,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:39:01,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027503709] [2022-12-14 05:39:01,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027503709] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:39:01,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905782546] [2022-12-14 05:39:01,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:39:01,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:39:01,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:39:01,990 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:39:01,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 05:39:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:39:02,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 119 conjunts are in the unsatisfiable core [2022-12-14 05:39:02,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:39:02,202 INFO L321 Elim1Store]: treesize reduction 16, result has 52.9 percent of original size [2022-12-14 05:39:02,202 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 56 treesize of output 61 [2022-12-14 05:39:02,221 INFO L321 Elim1Store]: treesize reduction 39, result has 31.6 percent of original size [2022-12-14 05:39:02,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 78 [2022-12-14 05:39:02,227 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 05:39:02,242 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:39:02,242 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 21 treesize of output 25 [2022-12-14 05:39:02,249 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 10 treesize of output 9 [2022-12-14 05:39:02,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2022-12-14 05:39:02,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:39:02,286 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 52 treesize of output 39 [2022-12-14 05:39:02,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 27 [2022-12-14 05:39:17,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:39:17,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:39:17,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:39:17,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:39:17,233 INFO L321 Elim1Store]: treesize reduction 257, result has 10.8 percent of original size [2022-12-14 05:39:17,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 132 treesize of output 115 [2022-12-14 05:39:17,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:39:17,239 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2022-12-14 05:39:17,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:39:17,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:39:17,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 83 [2022-12-14 05:39:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:39:23,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:39:30,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905782546] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:39:30,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1463750743] [2022-12-14 05:39:30,227 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-12-14 05:39:30,227 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:39:30,228 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:39:30,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:39:30,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 30 [2022-12-14 05:39:30,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747795031] [2022-12-14 05:39:30,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:39:30,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 05:39:30,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:39:30,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 05:39:30,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1330, Unknown=6, NotChecked=0, Total=1482 [2022-12-14 05:39:30,230 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 30 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 05:39:32,258 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:39:51,347 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:39:53,505 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:39:55,687 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:39:57,708 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:39:59,791 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:40:02,403 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:40:20,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:40:20,025 INFO L93 Difference]: Finished difference Result 149 states and 182 transitions. [2022-12-14 05:40:20,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 05:40:20,026 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 35 [2022-12-14 05:40:20,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:40:20,027 INFO L225 Difference]: With dead ends: 149 [2022-12-14 05:40:20,027 INFO L226 Difference]: Without dead ends: 125 [2022-12-14 05:40:20,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 60.7s TimeCoverageRelationStatistics Valid=469, Invalid=3557, Unknown=6, NotChecked=0, Total=4032 [2022-12-14 05:40:20,030 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 117 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 116 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:40:20,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 444 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 683 Invalid, 7 Unknown, 0 Unchecked, 15.5s Time] [2022-12-14 05:40:20,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-12-14 05:40:20,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2022-12-14 05:40:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 81 states have internal predecessors, (87), 17 states have call successors, (17), 11 states have call predecessors, (17), 21 states have return successors, (35), 19 states have call predecessors, (35), 15 states have call successors, (35) [2022-12-14 05:40:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2022-12-14 05:40:20,049 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 35 [2022-12-14 05:40:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:40:20,050 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2022-12-14 05:40:20,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-14 05:40:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2022-12-14 05:40:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 05:40:20,051 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:40:20,051 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:40:20,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 05:40:20,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:40:20,253 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:40:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:40:20,254 INFO L85 PathProgramCache]: Analyzing trace with hash 899636400, now seen corresponding path program 2 times [2022-12-14 05:40:20,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:40:20,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942402104] [2022-12-14 05:40:20,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:40:20,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:40:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:40:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 05:40:20,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:40:20,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942402104] [2022-12-14 05:40:20,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942402104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:40:20,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:40:20,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 05:40:20,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902097246] [2022-12-14 05:40:20,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:40:20,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 05:40:20,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:40:20,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 05:40:20,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-14 05:40:20,444 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-14 05:40:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:40:20,603 INFO L93 Difference]: Finished difference Result 146 states and 179 transitions. [2022-12-14 05:40:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 05:40:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2022-12-14 05:40:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:40:20,604 INFO L225 Difference]: With dead ends: 146 [2022-12-14 05:40:20,604 INFO L226 Difference]: Without dead ends: 144 [2022-12-14 05:40:20,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-14 05:40:20,605 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:40:20,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 163 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:40:20,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-12-14 05:40:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 121. [2022-12-14 05:40:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 80 states have (on average 1.175) internal successors, (94), 85 states have internal predecessors, (94), 17 states have call successors, (17), 11 states have call predecessors, (17), 23 states have return successors, (38), 24 states have call predecessors, (38), 15 states have call successors, (38) [2022-12-14 05:40:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 149 transitions. [2022-12-14 05:40:20,616 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 149 transitions. Word has length 36 [2022-12-14 05:40:20,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:40:20,617 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 149 transitions. [2022-12-14 05:40:20,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-14 05:40:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 149 transitions. [2022-12-14 05:40:20,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 05:40:20,617 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:40:20,618 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:40:20,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 05:40:20,618 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:40:20,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:40:20,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2043450021, now seen corresponding path program 2 times [2022-12-14 05:40:20,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:40:20,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860159902] [2022-12-14 05:40:20,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:40:20,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:40:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:40:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 05:40:21,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:40:21,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860159902] [2022-12-14 05:40:21,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860159902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:40:21,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154587688] [2022-12-14 05:40:21,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:40:21,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:40:21,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:40:21,557 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:40:21,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 05:40:21,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 05:40:21,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:40:21,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 123 conjunts are in the unsatisfiable core [2022-12-14 05:40:21,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:40:21,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 05:40:21,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:40:21,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:40:21,879 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 05:40:21,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 05:40:21,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:40:21,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-12-14 05:40:21,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:40:21,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-12-14 05:40:22,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:40:22,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:40:22,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:40:22,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:40:22,657 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 05:40:22,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 62 [2022-12-14 05:40:22,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:40:22,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:40:22,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:40:22,668 INFO L321 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-12-14 05:40:22,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 61 [2022-12-14 05:40:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 05:40:23,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:40:23,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:40:23,847 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 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-14 05:40:31,903 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 104 DAG size of output: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:40:33,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154587688] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:40:33,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [42129239] [2022-12-14 05:40:33,133 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-12-14 05:40:33,133 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:40:33,133 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:40:33,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:40:33,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 27 [2022-12-14 05:40:33,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95042427] [2022-12-14 05:40:33,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:40:33,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 05:40:33,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:40:33,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 05:40:33,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=921, Unknown=2, NotChecked=0, Total=1056 [2022-12-14 05:40:33,135 INFO L87 Difference]: Start difference. First operand 121 states and 149 transitions. Second operand has 27 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-14 05:40:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:40:38,745 INFO L93 Difference]: Finished difference Result 357 states and 443 transitions. [2022-12-14 05:40:38,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-14 05:40:38,745 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 42 [2022-12-14 05:40:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:40:38,747 INFO L225 Difference]: With dead ends: 357 [2022-12-14 05:40:38,747 INFO L226 Difference]: Without dead ends: 233 [2022-12-14 05:40:38,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1476 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=813, Invalid=4441, Unknown=2, NotChecked=0, Total=5256 [2022-12-14 05:40:38,748 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 76 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 100 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 05:40:38,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 281 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 716 Invalid, 1 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 05:40:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-12-14 05:40:38,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 187. [2022-12-14 05:40:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 125 states have (on average 1.184) internal successors, (148), 134 states have internal predecessors, (148), 27 states have call successors, (27), 18 states have call predecessors, (27), 34 states have return successors, (57), 34 states have call predecessors, (57), 25 states have call successors, (57) [2022-12-14 05:40:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 232 transitions. [2022-12-14 05:40:38,768 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 232 transitions. Word has length 42 [2022-12-14 05:40:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:40:38,768 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 232 transitions. [2022-12-14 05:40:38,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-14 05:40:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 232 transitions. [2022-12-14 05:40:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 05:40:38,769 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:40:38,769 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:40:38,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 05:40:38,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:40:38,971 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:40:38,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:40:38,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1763885732, now seen corresponding path program 3 times [2022-12-14 05:40:38,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:40:38,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875871543] [2022-12-14 05:40:38,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:40:38,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:40:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:40:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-14 05:40:39,135 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:40:39,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875871543] [2022-12-14 05:40:39,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875871543] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:40:39,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357778426] [2022-12-14 05:40:39,135 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:40:39,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:40:39,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:40:39,137 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:40:39,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 05:40:39,285 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:40:39,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:40:39,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 144 conjunts are in the unsatisfiable core [2022-12-14 05:40:39,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:40:39,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:40:39,376 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 05:40:39,394 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:40:39,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-12-14 05:40:39,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:40:39,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 05:40:39,419 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:40:39,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-12-14 05:40:39,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:40:39,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:40:39,731 INFO L321 Elim1Store]: treesize reduction 98, result has 28.5 percent of original size [2022-12-14 05:40:39,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 134 [2022-12-14 05:40:39,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:40:39,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:40:39,782 INFO L321 Elim1Store]: treesize reduction 58, result has 34.1 percent of original size [2022-12-14 05:40:39,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 74 [2022-12-14 05:40:39,797 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 10 treesize of output 9 [2022-12-14 05:40:40,015 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 16 treesize of output 15 [2022-12-14 05:40:40,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:40:40,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:40:40,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2022-12-14 05:40:40,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:40:40,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:40:40,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 169 treesize of output 168 [2022-12-14 05:40:40,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:40:40,183 INFO L321 Elim1Store]: treesize reduction 18, result has 62.5 percent of original size [2022-12-14 05:40:40,184 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 107 [2022-12-14 05:40:40,193 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:40:40,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:40:40,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:40:43,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:40:43,874 INFO L321 Elim1Store]: treesize reduction 1709, result has 8.0 percent of original size [2022-12-14 05:40:43,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 4 disjoint index pairs (out of 153 index pairs), introduced 19 new quantified variables, introduced 162 case distinctions, treesize of input 433 treesize of output 457 [2022-12-14 05:40:44,330 INFO L321 Elim1Store]: treesize reduction 593, result has 20.4 percent of original size [2022-12-14 05:40:44,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 53 case distinctions, treesize of input 449 treesize of output 525 [2022-12-14 05:40:44,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-14 05:40:44,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 05:40:44,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-14 05:40:44,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 05:40:44,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2022-12-14 05:40:44,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 05:40:44,990 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:40:45,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-12-14 05:40:45,091 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:40:45,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-14 05:40:45,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-14 05:40:45,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-14 05:40:45,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-14 05:40:45,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2022-12-14 05:40:45,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-12-14 05:40:45,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-12-14 05:40:46,291 INFO L321 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2022-12-14 05:40:46,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 137 [2022-12-14 05:40:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 39 refuted. 6 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 05:40:48,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:40:49,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357778426] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:40:49,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [773872596] [2022-12-14 05:40:49,060 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-12-14 05:40:49,060 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:40:49,060 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:40:49,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:40:49,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 25] total 29 [2022-12-14 05:40:49,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747685695] [2022-12-14 05:40:49,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:40:49,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 05:40:49,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:40:49,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 05:40:49,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=763, Unknown=17, NotChecked=0, Total=870 [2022-12-14 05:40:49,062 INFO L87 Difference]: Start difference. First operand 187 states and 232 transitions. Second operand has 29 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 7 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-12-14 05:40:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:40:52,273 INFO L93 Difference]: Finished difference Result 250 states and 309 transitions. [2022-12-14 05:40:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 05:40:52,275 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 7 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) Word has length 45 [2022-12-14 05:40:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:40:52,276 INFO L225 Difference]: With dead ends: 250 [2022-12-14 05:40:52,276 INFO L226 Difference]: Without dead ends: 194 [2022-12-14 05:40:52,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=134, Invalid=1171, Unknown=27, NotChecked=0, Total=1332 [2022-12-14 05:40:52,278 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 6 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:40:52,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 338 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 404 Invalid, 18 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 05:40:52,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-12-14 05:40:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 185. [2022-12-14 05:40:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 124 states have (on average 1.1693548387096775) internal successors, (145), 132 states have internal predecessors, (145), 27 states have call successors, (27), 18 states have call predecessors, (27), 33 states have return successors, (56), 34 states have call predecessors, (56), 25 states have call successors, (56) [2022-12-14 05:40:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 228 transitions. [2022-12-14 05:40:52,314 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 228 transitions. Word has length 45 [2022-12-14 05:40:52,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:40:52,314 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 228 transitions. [2022-12-14 05:40:52,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 7 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-12-14 05:40:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 228 transitions. [2022-12-14 05:40:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 05:40:52,316 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:40:52,316 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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:40:52,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-14 05:40:52,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 05:40:52,517 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:40:52,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:40:52,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1131900261, now seen corresponding path program 1 times [2022-12-14 05:40:52,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:40:52,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982515650] [2022-12-14 05:40:52,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:40:52,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:40:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:40:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 05:40:54,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:40:54,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982515650] [2022-12-14 05:40:54,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982515650] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:40:54,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920339369] [2022-12-14 05:40:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:40:54,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:40:54,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:40:54,543 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:40:54,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 05:40:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:40:54,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 140 conjunts are in the unsatisfiable core [2022-12-14 05:40:54,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:40:54,795 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 05:40:54,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:40:54,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 05:40:54,820 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:40:54,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-12-14 05:40:54,837 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:40:54,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-12-14 05:40:54,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:40:54,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:40:57,237 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_9| Int) (|v_is_list_containing_x_#in~l.base_BEFORE_CALL_9| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_9|) (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_9| 4)) 0))) (exists ((|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_9| Int) (|v_is_list_containing_x_#in~l.base_BEFORE_CALL_9| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_9|) (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_9| 4)) 0)))) is different from true [2022-12-14 05:41:07,336 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:41:15,474 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:41:15,856 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:41:15,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:41:15,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:41:15,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:41:15,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:41:15,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:41:15,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:41:15,903 INFO L321 Elim1Store]: treesize reduction 49, result has 22.2 percent of original size [2022-12-14 05:41:15,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 106 treesize of output 79 [2022-12-14 05:41:15,914 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 10 treesize of output 9 [2022-12-14 05:41:15,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:41:15,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:41:15,924 INFO L321 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-12-14 05:41:15,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 61 [2022-12-14 05:41:16,967 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:41:16,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:41:16,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:41:16,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:41:17,000 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 05:41:17,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 75 [2022-12-14 05:41:17,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:41:17,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 25 [2022-12-14 05:41:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 05:41:17,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:41:18,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920339369] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:41:18,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1089886484] [2022-12-14 05:41:18,205 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-12-14 05:41:18,205 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:41:18,205 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:41:18,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:41:18,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 38 [2022-12-14 05:41:18,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217854907] [2022-12-14 05:41:18,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:41:18,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 05:41:18,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:41:18,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 05:41:18,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1555, Unknown=3, NotChecked=80, Total=1806 [2022-12-14 05:41:18,207 INFO L87 Difference]: Start difference. First operand 185 states and 228 transitions. Second operand has 38 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 10 states have call successors, (11), 5 states have call predecessors, (11), 9 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10) [2022-12-14 05:41:20,593 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:41:22,610 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:41:24,623 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:41:28,683 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:41:30,688 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:41:36,894 WARN L233 SmtUtils]: Spent 6.03s 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:41:42,994 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:41:47,645 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:41:51,690 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:41:59,860 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:42:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:42:03,418 INFO L93 Difference]: Finished difference Result 276 states and 331 transitions. [2022-12-14 05:42:03,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 05:42:03,419 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 10 states have call successors, (11), 5 states have call predecessors, (11), 9 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10) Word has length 41 [2022-12-14 05:42:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:42:03,420 INFO L225 Difference]: With dead ends: 276 [2022-12-14 05:42:03,420 INFO L226 Difference]: Without dead ends: 224 [2022-12-14 05:42:03,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 52.6s TimeCoverageRelationStatistics Valid=416, Invalid=3613, Unknown=7, NotChecked=124, Total=4160 [2022-12-14 05:42:03,421 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 59 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 75 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:42:03,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 400 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 668 Invalid, 7 Unknown, 86 Unchecked, 15.1s Time] [2022-12-14 05:42:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-12-14 05:42:03,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 183. [2022-12-14 05:42:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 131 states have internal predecessors, (141), 26 states have call successors, (26), 20 states have call predecessors, (26), 32 states have return successors, (51), 31 states have call predecessors, (51), 24 states have call successors, (51) [2022-12-14 05:42:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 218 transitions. [2022-12-14 05:42:03,442 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 218 transitions. Word has length 41 [2022-12-14 05:42:03,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:42:03,443 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 218 transitions. [2022-12-14 05:42:03,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 10 states have call successors, (11), 5 states have call predecessors, (11), 9 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10) [2022-12-14 05:42:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 218 transitions. [2022-12-14 05:42:03,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 05:42:03,443 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:42:03,443 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:42:03,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 05:42:03,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 05:42:03,645 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:42:03,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:42:03,646 INFO L85 PathProgramCache]: Analyzing trace with hash 96045990, now seen corresponding path program 3 times [2022-12-14 05:42:03,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:42:03,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185984683] [2022-12-14 05:42:03,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:42:03,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:42:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:42:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 05:42:05,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:42:05,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185984683] [2022-12-14 05:42:05,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185984683] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:42:05,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80208851] [2022-12-14 05:42:05,319 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:42:05,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:42:05,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:42:05,320 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:42:05,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 05:42:05,437 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:42:05,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:42:05,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 124 conjunts are in the unsatisfiable core [2022-12-14 05:42:05,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:42:05,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:05,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:05,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2022-12-14 05:42:05,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:05,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:05,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2022-12-14 05:42:05,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:05,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 05:42:05,593 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 10 treesize of output 9 [2022-12-14 05:42:05,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 27 [2022-12-14 05:42:05,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:05,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-12-14 05:42:05,615 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 10 treesize of output 9 [2022-12-14 05:42:05,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 27 [2022-12-14 05:42:06,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:06,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:42:06,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:06,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:42:06,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:42:06,500 INFO L321 Elim1Store]: treesize reduction 173, result has 10.8 percent of original size [2022-12-14 05:42:06,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 174 treesize of output 91 [2022-12-14 05:42:06,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:06,509 INFO L321 Elim1Store]: treesize reduction 65, result has 1.5 percent of original size [2022-12-14 05:42:06,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 72 [2022-12-14 05:42:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:42:07,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:42:08,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80208851] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:42:08,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [57604654] [2022-12-14 05:42:08,190 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-12-14 05:42:08,190 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:42:08,190 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:42:08,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:42:08,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 38 [2022-12-14 05:42:08,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70445623] [2022-12-14 05:42:08,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:42:08,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 05:42:08,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:42:08,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 05:42:08,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 05:42:08,193 INFO L87 Difference]: Start difference. First operand 183 states and 218 transitions. Second operand has 38 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 34 states have internal predecessors, (59), 11 states have call successors, (11), 4 states have call predecessors, (11), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 05:42:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:42:13,134 INFO L93 Difference]: Finished difference Result 280 states and 334 transitions. [2022-12-14 05:42:13,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-14 05:42:13,135 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 34 states have internal predecessors, (59), 11 states have call successors, (11), 4 states have call predecessors, (11), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 44 [2022-12-14 05:42:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:42:13,136 INFO L225 Difference]: With dead ends: 280 [2022-12-14 05:42:13,136 INFO L226 Difference]: Without dead ends: 169 [2022-12-14 05:42:13,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=594, Invalid=4662, Unknown=0, NotChecked=0, Total=5256 [2022-12-14 05:42:13,137 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 121 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 05:42:13,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 374 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-14 05:42:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-12-14 05:42:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2022-12-14 05:42:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 100 states have (on average 1.12) internal successors, (112), 104 states have internal predecessors, (112), 22 states have call successors, (22), 17 states have call predecessors, (22), 22 states have return successors, (35), 23 states have call predecessors, (35), 21 states have call successors, (35) [2022-12-14 05:42:13,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2022-12-14 05:42:13,158 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 44 [2022-12-14 05:42:13,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:42:13,158 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2022-12-14 05:42:13,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 34 states have internal predecessors, (59), 11 states have call successors, (11), 4 states have call predecessors, (11), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 05:42:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2022-12-14 05:42:13,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 05:42:13,159 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:42:13,159 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-12-14 05:42:13,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 05:42:13,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 05:42:13,361 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:42:13,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:42:13,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1893652922, now seen corresponding path program 2 times [2022-12-14 05:42:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:42:13,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431292107] [2022-12-14 05:42:13,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:42:13,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:42:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:42:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:42:14,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:42:14,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431292107] [2022-12-14 05:42:14,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431292107] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:42:14,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979962327] [2022-12-14 05:42:14,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:42:14,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:42:14,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:42:14,767 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:42:14,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 05:42:15,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 05:42:15,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:42:15,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 107 conjunts are in the unsatisfiable core [2022-12-14 05:42:15,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:42:15,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 05:42:15,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:15,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:15,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2022-12-14 05:42:15,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:15,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 05:42:15,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2022-12-14 05:42:15,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:15,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2022-12-14 05:42:15,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 27 [2022-12-14 05:42:16,332 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:42:16,374 INFO L321 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-12-14 05:42:16,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 98 [2022-12-14 05:42:16,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:16,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2022-12-14 05:42:16,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-12-14 05:42:16,403 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 10 treesize of output 9 [2022-12-14 05:42:17,067 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:42:17,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:17,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:42:17,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:17,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:42:17,099 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 05:42:17,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2022-12-14 05:42:17,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:17,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:42:17,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-12-14 05:42:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:42:17,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:42:18,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979962327] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:42:18,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2058642249] [2022-12-14 05:42:18,424 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-12-14 05:42:18,424 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:42:18,424 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:42:18,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:42:18,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 36 [2022-12-14 05:42:18,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116435339] [2022-12-14 05:42:18,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:42:18,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 05:42:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:42:18,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 05:42:18,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1482, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 05:42:18,427 INFO L87 Difference]: Start difference. First operand 145 states and 169 transitions. Second operand has 36 states, 32 states have (on average 1.90625) internal successors, (61), 32 states have internal predecessors, (61), 9 states have call successors, (11), 5 states have call predecessors, (11), 8 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2022-12-14 05:42:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:42:21,859 INFO L93 Difference]: Finished difference Result 188 states and 213 transitions. [2022-12-14 05:42:21,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-14 05:42:21,860 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 1.90625) internal successors, (61), 32 states have internal predecessors, (61), 9 states have call successors, (11), 5 states have call predecessors, (11), 8 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 43 [2022-12-14 05:42:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:42:21,862 INFO L225 Difference]: With dead ends: 188 [2022-12-14 05:42:21,862 INFO L226 Difference]: Without dead ends: 181 [2022-12-14 05:42:21,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=677, Invalid=4873, Unknown=0, NotChecked=0, Total=5550 [2022-12-14 05:42:21,865 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 146 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:42:21,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 398 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 05:42:21,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-12-14 05:42:21,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 145. [2022-12-14 05:42:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 100 states have (on average 1.11) internal successors, (111), 104 states have internal predecessors, (111), 22 states have call successors, (22), 17 states have call predecessors, (22), 22 states have return successors, (35), 23 states have call predecessors, (35), 21 states have call successors, (35) [2022-12-14 05:42:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2022-12-14 05:42:21,890 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 43 [2022-12-14 05:42:21,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:42:21,890 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2022-12-14 05:42:21,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 1.90625) internal successors, (61), 32 states have internal predecessors, (61), 9 states have call successors, (11), 5 states have call predecessors, (11), 8 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2022-12-14 05:42:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2022-12-14 05:42:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 05:42:21,891 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:42:21,891 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 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, 1] [2022-12-14 05:42:21,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 05:42:22,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:42:22,092 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:42:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:42:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1093957072, now seen corresponding path program 3 times [2022-12-14 05:42:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:42:22,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936442510] [2022-12-14 05:42:22,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:42:22,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:42:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:42:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:42:22,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:42:22,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936442510] [2022-12-14 05:42:22,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936442510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:42:22,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:42:22,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 05:42:22,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498485598] [2022-12-14 05:42:22,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:42:22,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 05:42:22,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:42:22,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 05:42:22,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:42:22,263 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 05:42:22,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:42:22,408 INFO L93 Difference]: Finished difference Result 164 states and 188 transitions. [2022-12-14 05:42:22,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 05:42:22,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 47 [2022-12-14 05:42:22,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:42:22,409 INFO L225 Difference]: With dead ends: 164 [2022-12-14 05:42:22,410 INFO L226 Difference]: Without dead ends: 88 [2022-12-14 05:42:22,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 05:42:22,410 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:42:22,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 135 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:42:22,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-12-14 05:42:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-12-14 05:42:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.096774193548387) internal successors, (68), 63 states have internal predecessors, (68), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) [2022-12-14 05:42:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2022-12-14 05:42:22,424 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 47 [2022-12-14 05:42:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:42:22,424 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2022-12-14 05:42:22,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 05:42:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2022-12-14 05:42:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 05:42:22,424 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:42:22,425 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 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] [2022-12-14 05:42:22,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 05:42:22,425 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:42:22,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:42:22,425 INFO L85 PathProgramCache]: Analyzing trace with hash -582501657, now seen corresponding path program 4 times [2022-12-14 05:42:22,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:42:22,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157983756] [2022-12-14 05:42:22,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:42:22,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:42:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:42:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 39 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 05:42:25,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:42:25,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157983756] [2022-12-14 05:42:25,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157983756] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:42:25,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181467393] [2022-12-14 05:42:25,295 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:42:25,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:42:25,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:42:25,296 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:42:25,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f0a983d-5232-4e88-94e9-1eb0eb0066a3/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 05:42:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:42:25,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 94 conjunts are in the unsatisfiable core [2022-12-14 05:42:25,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:42:25,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:25,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:25,646 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 16 treesize of output 16 [2022-12-14 05:42:25,650 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 10 treesize of output 9 [2022-12-14 05:42:25,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:25,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:25,659 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 0 case distinctions, treesize of input 24 treesize of output 28 [2022-12-14 05:42:25,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:42:25,664 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 05:42:25,672 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 10 treesize of output 9 [2022-12-14 05:42:25,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 27 [2022-12-14 05:42:44,352 WARN L233 SmtUtils]: Spent 8.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:42:56,510 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:43:04,726 WARN L233 SmtUtils]: Spent 8.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:43:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 05:43:05,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:43:06,709 INFO L321 Elim1Store]: treesize reduction 18, result has 65.4 percent of original size [2022-12-14 05:43:06,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1020 treesize of output 801 [2022-12-14 05:43:06,981 INFO L321 Elim1Store]: treesize reduction 44, result has 66.9 percent of original size [2022-12-14 05:43:06,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32772 treesize of output 29836 [2022-12-14 05:43:07,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:43:07,095 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29806 treesize of output 26084 [2022-12-14 05:43:07,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:43:07,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 45005 treesize of output 42078 [2022-12-14 05:43:08,787 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:43:08,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 41868 treesize of output 38294 [2022-12-14 05:43:09,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:43:09,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 43971 treesize of output 41485 [2022-12-14 05:43:11,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:43:11,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 40936 treesize of output 39291