./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI --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 f0996d70f204c5713a65b04e25037e48d7532ec1ba0c10162e12c5c0d518b4e3 --- 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-5e519f3 [2022-11-03 04:00:46,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 04:00:46,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 04:00:46,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 04:00:46,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 04:00:46,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 04:00:46,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 04:00:46,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 04:00:46,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 04:00:46,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 04:00:46,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 04:00:46,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 04:00:46,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 04:00:46,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 04:00:46,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 04:00:46,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 04:00:46,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 04:00:46,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 04:00:46,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 04:00:46,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 04:00:46,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 04:00:46,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 04:00:46,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 04:00:46,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 04:00:46,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 04:00:46,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 04:00:46,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 04:00:46,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 04:00:46,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 04:00:46,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 04:00:46,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 04:00:46,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 04:00:46,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 04:00:46,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 04:00:46,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 04:00:46,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 04:00:46,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 04:00:46,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 04:00:46,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 04:00:46,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 04:00:46,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 04:00:46,949 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 04:00:46,991 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 04:00:46,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 04:00:46,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 04:00:46,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 04:00:46,993 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 04:00:46,994 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 04:00:46,994 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 04:00:46,994 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 04:00:46,995 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 04:00:46,995 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 04:00:46,996 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 04:00:46,997 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 04:00:46,997 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 04:00:46,997 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 04:00:46,998 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 04:00:46,998 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 04:00:46,998 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 04:00:46,998 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 04:00:46,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 04:00:47,000 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 04:00:47,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 04:00:47,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 04:00:47,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 04:00:47,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 04:00:47,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 04:00:47,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 04:00:47,001 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 04:00:47,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 04:00:47,003 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 04:00:47,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 04:00:47,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 04:00:47,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 04:00:47,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:00:47,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 04:00:47,005 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 04:00:47,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 04:00:47,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 04:00:47,006 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 04:00:47,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 04:00:47,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 04:00:47,007 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 04:00:47,007 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_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/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_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI 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 -> f0996d70f204c5713a65b04e25037e48d7532ec1ba0c10162e12c5c0d518b4e3 [2022-11-03 04:00:47,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 04:00:47,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 04:00:47,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 04:00:47,377 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 04:00:47,378 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 04:00:47,380 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.c [2022-11-03 04:00:47,474 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/data/357397f33/3f1668945af94aab8e47cd01fe901d53/FLAG0ae1737c4 [2022-11-03 04:00:48,299 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 04:00:48,300 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.c [2022-11-03 04:00:48,374 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/data/357397f33/3f1668945af94aab8e47cd01fe901d53/FLAG0ae1737c4 [2022-11-03 04:00:48,822 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/data/357397f33/3f1668945af94aab8e47cd01fe901d53 [2022-11-03 04:00:48,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 04:00:48,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 04:00:48,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 04:00:48,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 04:00:48,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 04:00:48,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:00:48" (1/1) ... [2022-11-03 04:00:48,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57392d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:48, skipping insertion in model container [2022-11-03 04:00:48,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:00:48" (1/1) ... [2022-11-03 04:00:48,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 04:00:48,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 04:00:49,737 WARN L230 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_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.c[84645,84658] [2022-11-03 04:00:50,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:00:50,188 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 04:00:50,315 WARN L230 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_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.c[84645,84658] [2022-11-03 04:00:50,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:00:50,654 INFO L208 MainTranslator]: Completed translation [2022-11-03 04:00:50,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:50 WrapperNode [2022-11-03 04:00:50,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 04:00:50,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 04:00:50,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 04:00:50,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 04:00:50,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:50" (1/1) ... [2022-11-03 04:00:50,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:50" (1/1) ... [2022-11-03 04:00:50,975 INFO L138 Inliner]: procedures = 127, calls = 1459, calls flagged for inlining = 20, calls inlined = 18, statements flattened = 3749 [2022-11-03 04:00:50,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 04:00:50,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 04:00:50,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 04:00:50,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 04:00:50,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:50" (1/1) ... [2022-11-03 04:00:50,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:50" (1/1) ... [2022-11-03 04:00:51,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:50" (1/1) ... [2022-11-03 04:00:51,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:50" (1/1) ... [2022-11-03 04:00:51,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:50" (1/1) ... [2022-11-03 04:00:51,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:50" (1/1) ... [2022-11-03 04:00:51,311 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:50" (1/1) ... [2022-11-03 04:00:51,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:50" (1/1) ... [2022-11-03 04:00:51,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 04:00:51,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 04:00:51,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 04:00:51,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 04:00:51,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:50" (1/1) ... [2022-11-03 04:00:51,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:00:51,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:51,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 04:00:51,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 04:00:51,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-03 04:00:51,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-03 04:00:51,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-03 04:00:51,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 04:00:51,469 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-11-03 04:00:51,469 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-11-03 04:00:51,469 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2022-11-03 04:00:51,469 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2022-11-03 04:00:51,469 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-03 04:00:51,469 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-03 04:00:51,470 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfAddCounters [2022-11-03 04:00:51,470 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfAddCounters [2022-11-03 04:00:51,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-03 04:00:51,470 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-03 04:00:51,470 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-11-03 04:00:51,471 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-11-03 04:00:51,471 INFO L130 BoogieDeclarations]: Found specification of procedure IoWMIRegistrationControl [2022-11-03 04:00:51,471 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWMIRegistrationControl [2022-11-03 04:00:51,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 04:00:51,471 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-03 04:00:51,472 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-03 04:00:51,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-03 04:00:51,472 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-03 04:00:51,472 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-03 04:00:51,472 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-03 04:00:51,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 04:00:51,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 04:00:51,473 INFO L130 BoogieDeclarations]: Found specification of procedure KeQuerySystemTime [2022-11-03 04:00:51,473 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQuerySystemTime [2022-11-03 04:00:51,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 04:00:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 04:00:51,476 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-11-03 04:00:51,476 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-11-03 04:00:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 04:00:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2022-11-03 04:00:51,477 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2022-11-03 04:00:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 04:00:51,477 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfLogError [2022-11-03 04:00:51,478 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfLogError [2022-11-03 04:00:51,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 04:00:51,478 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryPerformanceCounter [2022-11-03 04:00:51,478 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryPerformanceCounter [2022-11-03 04:00:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-11-03 04:00:51,479 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-11-03 04:00:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-11-03 04:00:51,480 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-11-03 04:00:51,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-11-03 04:00:51,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-11-03 04:00:51,482 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2022-11-03 04:00:51,482 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2022-11-03 04:00:51,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 04:00:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2022-11-03 04:00:51,483 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2022-11-03 04:00:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2022-11-03 04:00:51,484 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2022-11-03 04:00:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-03 04:00:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-11-03 04:00:51,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-11-03 04:00:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 04:00:51,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 04:00:52,388 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 04:00:52,390 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 04:00:52,723 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 04:00:52,752 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-11-03 04:00:52,754 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-11-03 04:00:52,926 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 04:00:52,962 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-11-03 04:00:52,962 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-11-03 04:00:53,643 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 04:00:53,727 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-11-03 04:00:53,727 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-11-03 04:00:53,950 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 04:00:53,953 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 04:00:53,959 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-03 04:01:45,236 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##61: assume false; [2022-11-03 04:01:45,237 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume !false; [2022-11-03 04:01:45,237 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##129: assume !false; [2022-11-03 04:01:45,237 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##128: assume false; [2022-11-03 04:01:45,237 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2022-11-03 04:01:45,237 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2022-11-03 04:01:45,265 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 04:01:46,101 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 04:01:46,101 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-03 04:01:46,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:01:46 BoogieIcfgContainer [2022-11-03 04:01:46,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 04:01:46,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 04:01:46,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 04:01:46,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 04:01:46,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:00:48" (1/3) ... [2022-11-03 04:01:46,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba5448f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:01:46, skipping insertion in model container [2022-11-03 04:01:46,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:50" (2/3) ... [2022-11-03 04:01:46,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba5448f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:01:46, skipping insertion in model container [2022-11-03 04:01:46,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:01:46" (3/3) ... [2022-11-03 04:01:46,125 INFO L112 eAbstractionObserver]: Analyzing ICFG diskperf.i.cil-1.c [2022-11-03 04:01:46,150 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 04:01:46,150 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 04:01:46,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 04:01:46,257 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;@3d902e92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 04:01:46,258 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 04:01:46,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 293 states, 189 states have (on average 1.439153439153439) internal successors, (272), 207 states have internal predecessors, (272), 80 states have call successors, (80), 22 states have call predecessors, (80), 22 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2022-11-03 04:01:46,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:01:46,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:01:46,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:01:46,277 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:01:46,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:01:46,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1637586891, now seen corresponding path program 1 times [2022-11-03 04:01:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:01:46,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256771401] [2022-11-03 04:01:46,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:46,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:01:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:01:49,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:01:49,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256771401] [2022-11-03 04:01:49,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256771401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:01:49,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:01:49,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:01:49,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195056159] [2022-11-03 04:01:49,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:01:49,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 04:01:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:01:49,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 04:01:49,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 04:01:49,611 INFO L87 Difference]: Start difference. First operand has 293 states, 189 states have (on average 1.439153439153439) internal successors, (272), 207 states have internal predecessors, (272), 80 states have call successors, (80), 22 states have call predecessors, (80), 22 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:01:51,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:01:54,807 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 [] [2022-11-03 04:01:56,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:01:56,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:01:56,818 INFO L93 Difference]: Finished difference Result 582 states and 884 transitions. [2022-11-03 04:01:56,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 04:01:56,822 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 04:01:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:01:56,845 INFO L225 Difference]: With dead ends: 582 [2022-11-03 04:01:56,858 INFO L226 Difference]: Without dead ends: 289 [2022-11-03 04:01:56,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 04:01:56,877 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:01:56,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-11-03 04:01:56,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-03 04:01:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-11-03 04:01:56,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 187 states have (on average 1.374331550802139) internal successors, (257), 203 states have internal predecessors, (257), 80 states have call successors, (80), 22 states have call predecessors, (80), 21 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-03 04:01:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 403 transitions. [2022-11-03 04:01:56,991 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 403 transitions. Word has length 13 [2022-11-03 04:01:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:01:56,991 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 403 transitions. [2022-11-03 04:01:56,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:01:56,992 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 403 transitions. [2022-11-03 04:01:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:01:56,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:01:56,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:01:56,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 04:01:56,994 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:01:56,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:01:56,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1359317102, now seen corresponding path program 1 times [2022-11-03 04:01:56,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:01:56,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955944318] [2022-11-03 04:01:56,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:56,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:01:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:02:00,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:00,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955944318] [2022-11-03 04:02:00,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955944318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:00,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:00,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:02:00,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595662412] [2022-11-03 04:02:00,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:00,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:02:00,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:00,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:02:00,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:02:00,457 INFO L87 Difference]: Start difference. First operand 289 states and 403 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:02,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:02:05,209 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 [] [2022-11-03 04:02:07,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:02:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:07,634 INFO L93 Difference]: Finished difference Result 581 states and 810 transitions. [2022-11-03 04:02:07,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:02:07,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 04:02:07,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:07,638 INFO L225 Difference]: With dead ends: 581 [2022-11-03 04:02:07,638 INFO L226 Difference]: Without dead ends: 295 [2022-11-03 04:02:07,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:02:07,642 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 2 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:07,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1050 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 3 Unknown, 0 Unchecked, 7.1s Time] [2022-11-03 04:02:07,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-03 04:02:07,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2022-11-03 04:02:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 207 states have internal predecessors, (261), 80 states have call successors, (80), 22 states have call predecessors, (80), 21 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-03 04:02:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 407 transitions. [2022-11-03 04:02:07,665 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 407 transitions. Word has length 15 [2022-11-03 04:02:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:07,665 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 407 transitions. [2022-11-03 04:02:07,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 407 transitions. [2022-11-03 04:02:07,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 04:02:07,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:07,667 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:07,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 04:02:07,668 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:07,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1361326514, now seen corresponding path program 1 times [2022-11-03 04:02:07,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:07,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554575929] [2022-11-03 04:02:07,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:07,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:02:12,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:12,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554575929] [2022-11-03 04:02:12,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554575929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:12,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:12,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:02:12,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036202618] [2022-11-03 04:02:12,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:12,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:02:12,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:12,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:02:12,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:02:12,684 INFO L87 Difference]: Start difference. First operand 293 states and 407 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:14,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:02:17,174 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 [] [2022-11-03 04:02:19,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:02:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:19,597 INFO L93 Difference]: Finished difference Result 630 states and 879 transitions. [2022-11-03 04:02:19,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:02:19,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 04:02:19,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:19,604 INFO L225 Difference]: With dead ends: 630 [2022-11-03 04:02:19,604 INFO L226 Difference]: Without dead ends: 427 [2022-11-03 04:02:19,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:02:19,606 INFO L413 NwaCegarLoop]: 470 mSDtfsCounter, 250 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:19,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 713 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 3 Unknown, 0 Unchecked, 6.9s Time] [2022-11-03 04:02:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-11-03 04:02:19,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 414. [2022-11-03 04:02:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 266 states have (on average 1.3345864661654134) internal successors, (355), 280 states have internal predecessors, (355), 113 states have call successors, (113), 36 states have call predecessors, (113), 34 states have return successors, (110), 101 states have call predecessors, (110), 102 states have call successors, (110) [2022-11-03 04:02:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 578 transitions. [2022-11-03 04:02:19,646 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 578 transitions. Word has length 19 [2022-11-03 04:02:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:19,647 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 578 transitions. [2022-11-03 04:02:19,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 578 transitions. [2022-11-03 04:02:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 04:02:19,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:19,649 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:19,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 04:02:19,649 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1970266137, now seen corresponding path program 1 times [2022-11-03 04:02:19,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:19,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342942086] [2022-11-03 04:02:19,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:19,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:02:22,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:22,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342942086] [2022-11-03 04:02:22,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342942086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:22,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:22,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:02:22,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124257171] [2022-11-03 04:02:22,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:22,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:02:22,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:22,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:02:22,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:02:22,586 INFO L87 Difference]: Start difference. First operand 414 states and 578 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:24,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:02:27,135 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 [] [2022-11-03 04:02:29,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:02:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:29,449 INFO L93 Difference]: Finished difference Result 434 states and 604 transitions. [2022-11-03 04:02:29,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:02:29,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 04:02:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:29,455 INFO L225 Difference]: With dead ends: 434 [2022-11-03 04:02:29,455 INFO L226 Difference]: Without dead ends: 414 [2022-11-03 04:02:29,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:02:29,457 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 11 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:29,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 656 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 3 Unknown, 0 Unchecked, 6.8s Time] [2022-11-03 04:02:29,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-11-03 04:02:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2022-11-03 04:02:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 266 states have (on average 1.330827067669173) internal successors, (354), 280 states have internal predecessors, (354), 113 states have call successors, (113), 36 states have call predecessors, (113), 34 states have return successors, (110), 101 states have call predecessors, (110), 102 states have call successors, (110) [2022-11-03 04:02:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 577 transitions. [2022-11-03 04:02:29,497 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 577 transitions. Word has length 21 [2022-11-03 04:02:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:29,498 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 577 transitions. [2022-11-03 04:02:29,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 577 transitions. [2022-11-03 04:02:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 04:02:29,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:29,501 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, 1, 1, 1, 1] [2022-11-03 04:02:29,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 04:02:29,502 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:29,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1424320208, now seen corresponding path program 1 times [2022-11-03 04:02:29,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:29,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697694097] [2022-11-03 04:02:29,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:29,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:33,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:02:33,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:33,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697694097] [2022-11-03 04:02:33,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697694097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:33,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:33,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:02:33,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405687514] [2022-11-03 04:02:33,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:33,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:02:33,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:33,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:02:33,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:02:33,201 INFO L87 Difference]: Start difference. First operand 414 states and 577 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:35,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:02:37,782 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 [] [2022-11-03 04:02:39,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:02:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:40,188 INFO L93 Difference]: Finished difference Result 459 states and 635 transitions. [2022-11-03 04:02:40,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:02:40,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 04:02:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:40,193 INFO L225 Difference]: With dead ends: 459 [2022-11-03 04:02:40,193 INFO L226 Difference]: Without dead ends: 455 [2022-11-03 04:02:40,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:02:40,195 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 62 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:40,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 658 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 3 Unknown, 0 Unchecked, 6.9s Time] [2022-11-03 04:02:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-11-03 04:02:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 436. [2022-11-03 04:02:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 284 states have (on average 1.3380281690140845) internal successors, (380), 296 states have internal predecessors, (380), 115 states have call successors, (115), 39 states have call predecessors, (115), 36 states have return successors, (114), 103 states have call predecessors, (114), 104 states have call successors, (114) [2022-11-03 04:02:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 609 transitions. [2022-11-03 04:02:40,228 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 609 transitions. Word has length 26 [2022-11-03 04:02:40,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:40,228 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 609 transitions. [2022-11-03 04:02:40,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 609 transitions. [2022-11-03 04:02:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 04:02:40,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:40,231 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, 1, 1, 1, 1, 1] [2022-11-03 04:02:40,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 04:02:40,232 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:40,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:40,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1825189374, now seen corresponding path program 1 times [2022-11-03 04:02:40,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:40,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095643065] [2022-11-03 04:02:40,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:40,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:02:43,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:43,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095643065] [2022-11-03 04:02:43,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095643065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:43,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:43,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:02:43,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218423213] [2022-11-03 04:02:43,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:43,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:02:43,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:43,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:02:43,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:02:43,884 INFO L87 Difference]: Start difference. First operand 436 states and 609 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:46,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:02:48,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:02:50,489 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 [] [2022-11-03 04:02:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:50,746 INFO L93 Difference]: Finished difference Result 1014 states and 1433 transitions. [2022-11-03 04:02:50,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:02:50,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-03 04:02:50,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:50,752 INFO L225 Difference]: With dead ends: 1014 [2022-11-03 04:02:50,753 INFO L226 Difference]: Without dead ends: 680 [2022-11-03 04:02:50,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:02:50,755 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 323 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:50,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 649 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 6.8s Time] [2022-11-03 04:02:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-11-03 04:02:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 649. [2022-11-03 04:02:50,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 416 states have (on average 1.3197115384615385) internal successors, (549), 426 states have internal predecessors, (549), 176 states have call successors, (176), 58 states have call predecessors, (176), 56 states have return successors, (193), 169 states have call predecessors, (193), 167 states have call successors, (193) [2022-11-03 04:02:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 918 transitions. [2022-11-03 04:02:50,803 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 918 transitions. Word has length 27 [2022-11-03 04:02:50,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:50,804 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 918 transitions. [2022-11-03 04:02:50,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:50,804 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 918 transitions. [2022-11-03 04:02:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:02:50,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:50,806 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:50,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 04:02:50,807 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:50,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:50,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1015320627, now seen corresponding path program 1 times [2022-11-03 04:02:50,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:50,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919723936] [2022-11-03 04:02:50,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:50,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:02:54,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:54,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919723936] [2022-11-03 04:02:54,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919723936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:54,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:54,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 04:02:54,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963995823] [2022-11-03 04:02:54,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:54,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:02:54,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:54,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:02:54,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:02:54,832 INFO L87 Difference]: Start difference. First operand 649 states and 918 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-11-03 04:02:57,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:03:00,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:03:02,240 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 [] [2022-11-03 04:03:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:03,064 INFO L93 Difference]: Finished difference Result 690 states and 966 transitions. [2022-11-03 04:03:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 04:03:03,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 30 [2022-11-03 04:03:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:03,071 INFO L225 Difference]: With dead ends: 690 [2022-11-03 04:03:03,071 INFO L226 Difference]: Without dead ends: 679 [2022-11-03 04:03:03,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:03:03,073 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 433 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:03,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 649 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 455 Invalid, 3 Unknown, 0 Unchecked, 8.1s Time] [2022-11-03 04:03:03,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-11-03 04:03:03,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 665. [2022-11-03 04:03:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 431 states have (on average 1.3178654292343388) internal successors, (568), 442 states have internal predecessors, (568), 176 states have call successors, (176), 58 states have call predecessors, (176), 57 states have return successors, (194), 169 states have call predecessors, (194), 167 states have call successors, (194) [2022-11-03 04:03:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 938 transitions. [2022-11-03 04:03:03,182 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 938 transitions. Word has length 30 [2022-11-03 04:03:03,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:03,184 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 938 transitions. [2022-11-03 04:03:03,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-11-03 04:03:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 938 transitions. [2022-11-03 04:03:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 04:03:03,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:03,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:03,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 04:03:03,190 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:03,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1846308870, now seen corresponding path program 1 times [2022-11-03 04:03:03,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:03,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591597207] [2022-11-03 04:03:03,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:03,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:03:06,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:06,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591597207] [2022-11-03 04:03:06,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591597207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:03:06,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:03:06,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 04:03:06,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604941138] [2022-11-03 04:03:06,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:03:06,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:03:06,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:06,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:03:06,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:03:06,203 INFO L87 Difference]: Start difference. First operand 665 states and 938 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-11-03 04:03:08,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:03:11,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:03:13,720 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 [] [2022-11-03 04:03:14,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:14,528 INFO L93 Difference]: Finished difference Result 681 states and 951 transitions. [2022-11-03 04:03:14,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 04:03:14,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 31 [2022-11-03 04:03:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:14,535 INFO L225 Difference]: With dead ends: 681 [2022-11-03 04:03:14,535 INFO L226 Difference]: Without dead ends: 673 [2022-11-03 04:03:14,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:03:14,537 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 422 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:14,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 644 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 452 Invalid, 3 Unknown, 0 Unchecked, 8.2s Time] [2022-11-03 04:03:14,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-11-03 04:03:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 665. [2022-11-03 04:03:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 431 states have (on average 1.3155452436194897) internal successors, (567), 442 states have internal predecessors, (567), 176 states have call successors, (176), 58 states have call predecessors, (176), 57 states have return successors, (194), 169 states have call predecessors, (194), 167 states have call successors, (194) [2022-11-03 04:03:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 937 transitions. [2022-11-03 04:03:14,591 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 937 transitions. Word has length 31 [2022-11-03 04:03:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:14,591 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 937 transitions. [2022-11-03 04:03:14,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-11-03 04:03:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 937 transitions. [2022-11-03 04:03:14,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 04:03:14,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:14,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:14,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 04:03:14,594 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:14,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:14,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1668136284, now seen corresponding path program 1 times [2022-11-03 04:03:14,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:14,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281311386] [2022-11-03 04:03:14,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:14,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:17,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:03:17,229 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:17,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281311386] [2022-11-03 04:03:17,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281311386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:03:17,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:03:17,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:03:17,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54562498] [2022-11-03 04:03:17,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:03:17,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:03:17,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:17,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:03:17,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:03:17,231 INFO L87 Difference]: Start difference. First operand 665 states and 937 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-11-03 04:03:19,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:03:21,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:03:23,813 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 [] [2022-11-03 04:03:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:24,166 INFO L93 Difference]: Finished difference Result 1208 states and 1714 transitions. [2022-11-03 04:03:24,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:03:24,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 32 [2022-11-03 04:03:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:24,175 INFO L225 Difference]: With dead ends: 1208 [2022-11-03 04:03:24,175 INFO L226 Difference]: Without dead ends: 1179 [2022-11-03 04:03:24,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:03:24,177 INFO L413 NwaCegarLoop]: 461 mSDtfsCounter, 350 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:24,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 693 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 6.8s Time] [2022-11-03 04:03:24,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-11-03 04:03:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1159. [2022-11-03 04:03:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 743 states have (on average 1.3189771197846567) internal successors, (980), 755 states have internal predecessors, (980), 311 states have call successors, (311), 106 states have call predecessors, (311), 104 states have return successors, (361), 307 states have call predecessors, (361), 302 states have call successors, (361) [2022-11-03 04:03:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1652 transitions. [2022-11-03 04:03:24,273 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1652 transitions. Word has length 32 [2022-11-03 04:03:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:24,274 INFO L495 AbstractCegarLoop]: Abstraction has 1159 states and 1652 transitions. [2022-11-03 04:03:24,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-11-03 04:03:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1652 transitions. [2022-11-03 04:03:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:03:24,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:24,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:24,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 04:03:24,276 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:24,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:24,277 INFO L85 PathProgramCache]: Analyzing trace with hash -164175070, now seen corresponding path program 1 times [2022-11-03 04:03:24,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:24,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872740117] [2022-11-03 04:03:24,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:24,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:03:27,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:27,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872740117] [2022-11-03 04:03:27,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872740117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:03:27,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:03:27,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:03:27,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851349049] [2022-11-03 04:03:27,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:03:27,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:03:27,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:27,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:03:27,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:03:27,890 INFO L87 Difference]: Start difference. First operand 1159 states and 1652 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-11-03 04:03:30,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:03:32,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:03:34,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:03:36,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:03:38,754 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 [] [2022-11-03 04:03:38,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:38,980 INFO L93 Difference]: Finished difference Result 1173 states and 1665 transitions. [2022-11-03 04:03:38,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:03:38,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 33 [2022-11-03 04:03:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:38,988 INFO L225 Difference]: With dead ends: 1173 [2022-11-03 04:03:38,988 INFO L226 Difference]: Without dead ends: 1157 [2022-11-03 04:03:38,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:03:38,990 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:38,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 651 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 11.0s Time] [2022-11-03 04:03:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-11-03 04:03:39,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2022-11-03 04:03:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 742 states have (on average 1.3180592991913747) internal successors, (978), 754 states have internal predecessors, (978), 310 states have call successors, (310), 106 states have call predecessors, (310), 104 states have return successors, (360), 306 states have call predecessors, (360), 301 states have call successors, (360) [2022-11-03 04:03:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1648 transitions. [2022-11-03 04:03:39,073 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1648 transitions. Word has length 33 [2022-11-03 04:03:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:39,074 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1648 transitions. [2022-11-03 04:03:39,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-11-03 04:03:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1648 transitions. [2022-11-03 04:03:39,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:03:39,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:39,075 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:39,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 04:03:39,076 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:39,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash -452248886, now seen corresponding path program 1 times [2022-11-03 04:03:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:39,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381007276] [2022-11-03 04:03:39,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:39,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:03:42,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:42,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381007276] [2022-11-03 04:03:42,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381007276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:03:42,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:03:42,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:03:42,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567175777] [2022-11-03 04:03:42,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:03:42,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:03:42,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:42,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:03:42,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:03:42,203 INFO L87 Difference]: Start difference. First operand 1157 states and 1648 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:03:44,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:03:47,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:03:49,202 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 [] [2022-11-03 04:03:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:49,848 INFO L93 Difference]: Finished difference Result 1196 states and 1688 transitions. [2022-11-03 04:03:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:03:49,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:03:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:49,856 INFO L225 Difference]: With dead ends: 1196 [2022-11-03 04:03:49,856 INFO L226 Difference]: Without dead ends: 1170 [2022-11-03 04:03:49,857 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-11-03 04:03:49,858 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 362 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:49,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 488 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 258 Invalid, 3 Unknown, 0 Unchecked, 7.5s Time] [2022-11-03 04:03:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2022-11-03 04:03:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1157. [2022-11-03 04:03:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 742 states have (on average 1.3153638814016173) internal successors, (976), 754 states have internal predecessors, (976), 310 states have call successors, (310), 106 states have call predecessors, (310), 104 states have return successors, (360), 306 states have call predecessors, (360), 301 states have call successors, (360) [2022-11-03 04:03:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1646 transitions. [2022-11-03 04:03:49,949 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1646 transitions. Word has length 33 [2022-11-03 04:03:49,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:49,950 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1646 transitions. [2022-11-03 04:03:49,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:03:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1646 transitions. [2022-11-03 04:03:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 04:03:49,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:49,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:49,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 04:03:49,952 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:03:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:49,953 INFO L85 PathProgramCache]: Analyzing trace with hash -967075652, now seen corresponding path program 1 times [2022-11-03 04:03:49,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:49,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298209360] [2022-11-03 04:03:49,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:49,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:03:53,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:53,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298209360] [2022-11-03 04:03:53,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298209360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:03:53,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:03:53,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:03:53,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781401166] [2022-11-03 04:03:53,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:03:53,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:03:53,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:53,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:03:53,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:03:53,177 INFO L87 Difference]: Start difference. First operand 1157 states and 1646 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-11-03 04:03:55,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:03:57,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:03:59,892 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 [] [2022-11-03 04:04:00,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:00,358 INFO L93 Difference]: Finished difference Result 1720 states and 2543 transitions. [2022-11-03 04:04:00,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:04:00,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 35 [2022-11-03 04:04:00,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:00,370 INFO L225 Difference]: With dead ends: 1720 [2022-11-03 04:04:00,371 INFO L226 Difference]: Without dead ends: 1712 [2022-11-03 04:04:00,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:04:00,373 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 240 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:00,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 701 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 3 Unknown, 0 Unchecked, 7.1s Time] [2022-11-03 04:04:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-11-03 04:04:00,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1262. [2022-11-03 04:04:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 808 states have (on average 1.3217821782178218) internal successors, (1068), 825 states have internal predecessors, (1068), 338 states have call successors, (338), 115 states have call predecessors, (338), 115 states have return successors, (407), 331 states have call predecessors, (407), 329 states have call successors, (407) [2022-11-03 04:04:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1813 transitions. [2022-11-03 04:04:00,494 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1813 transitions. Word has length 35 [2022-11-03 04:04:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:00,494 INFO L495 AbstractCegarLoop]: Abstraction has 1262 states and 1813 transitions. [2022-11-03 04:04:00,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-11-03 04:04:00,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1813 transitions. [2022-11-03 04:04:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 04:04:00,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:00,496 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:00,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 04:04:00,497 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:00,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:00,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1260822521, now seen corresponding path program 1 times [2022-11-03 04:04:00,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:00,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200172672] [2022-11-03 04:04:00,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:00,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:04:03,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:03,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200172672] [2022-11-03 04:04:03,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200172672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:03,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:04:03,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:04:03,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964691350] [2022-11-03 04:04:03,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:03,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:04:03,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:03,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:04:03,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:04:03,603 INFO L87 Difference]: Start difference. First operand 1262 states and 1813 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:06,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:04:08,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:04:09,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:04:11,577 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 [] [2022-11-03 04:04:12,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:12,183 INFO L93 Difference]: Finished difference Result 1292 states and 1844 transitions. [2022-11-03 04:04:12,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:04:12,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-03 04:04:12,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:12,192 INFO L225 Difference]: With dead ends: 1292 [2022-11-03 04:04:12,192 INFO L226 Difference]: Without dead ends: 1266 [2022-11-03 04:04:12,193 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-11-03 04:04:12,194 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 355 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:12,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 495 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 252 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2022-11-03 04:04:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2022-11-03 04:04:12,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1262. [2022-11-03 04:04:12,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 808 states have (on average 1.3193069306930694) internal successors, (1066), 825 states have internal predecessors, (1066), 338 states have call successors, (338), 115 states have call predecessors, (338), 115 states have return successors, (407), 331 states have call predecessors, (407), 329 states have call successors, (407) [2022-11-03 04:04:12,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1811 transitions. [2022-11-03 04:04:12,324 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1811 transitions. Word has length 34 [2022-11-03 04:04:12,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:12,324 INFO L495 AbstractCegarLoop]: Abstraction has 1262 states and 1811 transitions. [2022-11-03 04:04:12,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:12,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1811 transitions. [2022-11-03 04:04:12,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 04:04:12,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:12,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:12,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 04:04:12,327 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:12,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:12,327 INFO L85 PathProgramCache]: Analyzing trace with hash 538837051, now seen corresponding path program 1 times [2022-11-03 04:04:12,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:12,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135044108] [2022-11-03 04:04:12,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:12,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:04:15,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:15,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135044108] [2022-11-03 04:04:15,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135044108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:15,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:04:15,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 04:04:15,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856639513] [2022-11-03 04:04:15,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:15,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:04:15,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:15,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:04:15,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:04:15,864 INFO L87 Difference]: Start difference. First operand 1262 states and 1811 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-11-03 04:04:18,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:04:20,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:04:21,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:04:22,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:04:25,144 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 [] [2022-11-03 04:04:26,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:26,539 INFO L93 Difference]: Finished difference Result 1726 states and 2544 transitions. [2022-11-03 04:04:26,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 04:04:26,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 36 [2022-11-03 04:04:26,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:26,551 INFO L225 Difference]: With dead ends: 1726 [2022-11-03 04:04:26,551 INFO L226 Difference]: Without dead ends: 1718 [2022-11-03 04:04:26,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:04:26,555 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 743 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 281 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:26,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 735 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 518 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2022-11-03 04:04:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2022-11-03 04:04:26,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1262. [2022-11-03 04:04:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 808 states have (on average 1.318069306930693) internal successors, (1065), 825 states have internal predecessors, (1065), 338 states have call successors, (338), 115 states have call predecessors, (338), 115 states have return successors, (407), 331 states have call predecessors, (407), 329 states have call successors, (407) [2022-11-03 04:04:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1810 transitions. [2022-11-03 04:04:26,721 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1810 transitions. Word has length 36 [2022-11-03 04:04:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:26,722 INFO L495 AbstractCegarLoop]: Abstraction has 1262 states and 1810 transitions. [2022-11-03 04:04:26,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-11-03 04:04:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1810 transitions. [2022-11-03 04:04:26,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 04:04:26,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:26,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:26,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 04:04:26,724 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:26,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:26,725 INFO L85 PathProgramCache]: Analyzing trace with hash 734936773, now seen corresponding path program 1 times [2022-11-03 04:04:26,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:26,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212364029] [2022-11-03 04:04:26,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:26,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:04:29,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:29,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212364029] [2022-11-03 04:04:29,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212364029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:29,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:04:29,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:04:29,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179518103] [2022-11-03 04:04:29,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:29,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:04:29,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:29,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:04:29,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:04:29,488 INFO L87 Difference]: Start difference. First operand 1262 states and 1810 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:31,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 04:04:33,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 04:04:36,038 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 [] [2022-11-03 04:04:36,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:36,519 INFO L93 Difference]: Finished difference Result 1820 states and 2714 transitions. [2022-11-03 04:04:36,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:04:36,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-03 04:04:36,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:36,530 INFO L225 Difference]: With dead ends: 1820 [2022-11-03 04:04:36,531 INFO L226 Difference]: Without dead ends: 1807 [2022-11-03 04:04:36,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:04:36,533 INFO L413 NwaCegarLoop]: 531 mSDtfsCounter, 244 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:36,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 815 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 3 Unknown, 0 Unchecked, 6.9s Time] [2022-11-03 04:04:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2022-11-03 04:04:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1261. [2022-11-03 04:04:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 807 states have (on average 1.3147459727385378) internal successors, (1061), 824 states have internal predecessors, (1061), 337 states have call successors, (337), 115 states have call predecessors, (337), 116 states have return successors, (415), 331 states have call predecessors, (415), 329 states have call successors, (415) [2022-11-03 04:04:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1813 transitions. [2022-11-03 04:04:36,694 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1813 transitions. Word has length 35 [2022-11-03 04:04:36,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:36,694 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 1813 transitions. [2022-11-03 04:04:36,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1813 transitions. [2022-11-03 04:04:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 04:04:36,696 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:36,696 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:36,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 04:04:36,697 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:36,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:36,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1372944730, now seen corresponding path program 1 times [2022-11-03 04:04:36,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:36,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707588949] [2022-11-03 04:04:36,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:36,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 04:04:39,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:39,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707588949] [2022-11-03 04:04:39,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707588949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:04:39,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378913102] [2022-11-03 04:04:39,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:39,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:39,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:04:39,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:04:39,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7b2b2df-3d7c-4792-a19d-4fe8dbdd2e81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 04:04:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:47,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 10159 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 04:04:47,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 04:04:47,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:04:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 04:04:47,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378913102] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:04:47,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1172915752] [2022-11-03 04:04:47,405 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-03 04:04:47,405 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:04:47,410 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:04:47,416 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:04:47,417 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:04:51,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:51,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:51,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:51,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:51,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:52,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:52,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:52,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:52,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:52,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:53,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:53,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:53,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:53,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:53,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:54,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:54,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:54,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:54,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:54,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:55,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:55,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:55,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,238 INFO L356 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-03 04:04:56,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-11-03 04:04:56,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2022-11-03 04:04:56,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:56,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:57,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 85 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 235 [2022-11-03 04:04:57,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:57,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:58,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:58,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:58,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:58,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 49 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:58,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:59,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:59,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:59,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:59,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:04:59,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:00,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:00,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:00,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:01,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:01,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:01,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:01,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:02,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:02,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:02,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:02,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:03,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:03,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:03,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:03,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:04,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:04,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:04,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:04,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:05,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:05,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:05,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:05,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:06,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:06,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:06,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:06,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:07,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:07,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:07,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:07,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:08,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:08,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:08,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 53 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:08,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:09,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:09,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:09,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:09,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:10,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:10,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:10,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:10,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:11,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:11,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:11,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:11,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:12,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:12,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:12,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:12,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:13,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:13,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:13,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:14,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:14,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:14,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:14,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:14,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 16 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 48 [2022-11-03 04:05:15,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:15,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:15,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:15,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:16,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:16,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:16,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:17,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:17,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:17,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:17,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:18,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:18,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:19,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:19,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:19,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:19,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:20,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:20,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:20,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:21,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:21,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-03 04:05:21,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 13 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 04:05:21,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:22,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:22,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:22,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 49 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:23,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:23,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:23,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 53 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:24,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:24,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:24,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:25,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:25,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:25,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:25,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:26,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:26,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:26,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:27,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:27,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:27,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:28,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:28,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:28,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:28,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:29,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 49 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:29,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:29,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:30,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:30,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 48 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:30,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:31,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:31,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:31,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:32,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:32,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:32,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:33,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:33,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:33,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:34,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:34,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:34,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:35,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:35,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:35,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:36,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:36,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 55 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:36,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:37,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:37,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:05:37,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2022-11-03 04:06:04,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-11-03 04:06:08,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-11-03 04:06:50,222 WARN L234 SmtUtils]: Spent 7.25s on a formula simplification that was a NOOP. DAG size: 4336 (called from [L 211] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.xJunctTerm) [2022-11-03 04:06:56,753 WARN L234 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 4336 (called from [L 211] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.xJunctTerm) [2022-11-03 04:07:04,797 WARN L234 SmtUtils]: Spent 7.93s on a formula simplification that was a NOOP. DAG size: 5410 (called from [L 211] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.xJunctTerm) [2022-11-03 04:07:26,326 WARN L234 SmtUtils]: Spent 6.25s on a formula simplification that was a NOOP. DAG size: 4346 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 04:09:15,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17158 treesize of output 17160 [2022-11-03 04:09:28,539 WARN L234 SmtUtils]: Spent 12.62s on a formula simplification. DAG size of input: 4355 DAG size of output: 4354 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 04:09:39,736 WARN L234 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 4348 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 04:09:40,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17158 treesize of output 17160 [2022-11-03 04:09:45,729 WARN L234 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 4349 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 04:09:56,609 WARN L234 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 4342 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 04:13:41,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-11-03 04:13:41,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-11-03 04:14:09,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:09,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:09,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:09,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:10,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:10,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:11,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:12,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:12,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:12,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:12,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:12,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:12,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:13,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:13,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:13,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:13,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:13,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:18,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:20,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:23,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:23,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:24,867 INFO L244 Elim1Store]: Index analysis took 15859 ms [2022-11-03 04:14:25,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:14:25,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:14:25,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:14:25,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:14:25,090 INFO L173 IndexEqualityManager]: detected equality via solver