./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/insertion_sort-1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/insertion_sort-1-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 36d1103e69366c6d9110aa7e24b0c4765120510facc121d7623fcf9373a67e96 --- 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-b5237d8 [2022-11-21 09:06:51,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 09:06:51,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 09:06:51,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 09:06:51,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 09:06:51,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 09:06:51,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 09:06:52,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 09:06:52,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 09:06:52,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 09:06:52,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 09:06:52,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 09:06:52,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 09:06:52,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 09:06:52,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 09:06:52,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 09:06:52,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 09:06:52,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 09:06:52,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 09:06:52,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 09:06:52,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 09:06:52,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 09:06:52,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 09:06:52,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 09:06:52,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 09:06:52,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 09:06:52,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 09:06:52,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 09:06:52,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 09:06:52,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 09:06:52,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 09:06:52,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 09:06:52,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 09:06:52,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 09:06:52,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 09:06:52,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 09:06:52,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 09:06:52,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 09:06:52,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 09:06:52,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 09:06:52,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 09:06:52,072 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 09:06:52,118 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 09:06:52,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 09:06:52,120 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 09:06:52,120 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 09:06:52,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 09:06:52,122 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 09:06:52,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 09:06:52,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 09:06:52,123 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 09:06:52,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 09:06:52,125 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 09:06:52,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 09:06:52,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 09:06:52,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 09:06:52,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 09:06:52,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 09:06:52,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 09:06:52,127 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 09:06:52,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 09:06:52,127 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 09:06:52,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 09:06:52,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 09:06:52,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 09:06:52,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 09:06:52,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:06:52,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 09:06:52,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 09:06:52,129 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 09:06:52,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 09:06:52,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 09:06:52,130 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 09:06:52,130 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 09:06:52,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 09:06:52,131 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_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/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_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a 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 -> Automizer 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 -> 36d1103e69366c6d9110aa7e24b0c4765120510facc121d7623fcf9373a67e96 [2022-11-21 09:06:52,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 09:06:52,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 09:06:52,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 09:06:52,547 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 09:06:52,547 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 09:06:52,549 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/loops/insertion_sort-1-2.c [2022-11-21 09:06:56,327 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 09:06:56,548 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 09:06:56,548 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/sv-benchmarks/c/loops/insertion_sort-1-2.c [2022-11-21 09:06:56,557 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/data/a3e69e0c5/6f69eca962ae41e9b10fc8c6e7bad3ed/FLAG403348548 [2022-11-21 09:06:56,575 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/data/a3e69e0c5/6f69eca962ae41e9b10fc8c6e7bad3ed [2022-11-21 09:06:56,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 09:06:56,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 09:06:56,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 09:06:56,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 09:06:56,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 09:06:56,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:06:56" (1/1) ... [2022-11-21 09:06:56,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e313cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:06:56, skipping insertion in model container [2022-11-21 09:06:56,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:06:56" (1/1) ... [2022-11-21 09:06:56,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 09:06:56,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 09:06:56,807 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/sv-benchmarks/c/loops/insertion_sort-1-2.c[330,343] [2022-11-21 09:06:56,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:06:56,851 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 09:06:56,865 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/sv-benchmarks/c/loops/insertion_sort-1-2.c[330,343] [2022-11-21 09:06:56,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 09:06:56,904 INFO L208 MainTranslator]: Completed translation [2022-11-21 09:06:56,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:06:56 WrapperNode [2022-11-21 09:06:56,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 09:06:56,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 09:06:56,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 09:06:56,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 09:06:56,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:06:56" (1/1) ... [2022-11-21 09:06:56,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:06:56" (1/1) ... [2022-11-21 09:06:56,944 INFO L138 Inliner]: procedures = 15, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 86 [2022-11-21 09:06:56,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 09:06:56,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 09:06:56,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 09:06:56,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 09:06:56,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:06:56" (1/1) ... [2022-11-21 09:06:56,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:06:56" (1/1) ... [2022-11-21 09:06:56,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:06:56" (1/1) ... [2022-11-21 09:06:56,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:06:56" (1/1) ... [2022-11-21 09:06:56,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:06:56" (1/1) ... [2022-11-21 09:06:56,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:06:56" (1/1) ... [2022-11-21 09:06:56,972 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:06:56" (1/1) ... [2022-11-21 09:06:56,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:06:56" (1/1) ... [2022-11-21 09:06:56,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 09:06:56,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 09:06:56,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 09:06:56,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 09:06:56,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:06:56" (1/1) ... [2022-11-21 09:06:56,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 09:06:57,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:06:57,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 09:06:57,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 09:06:57,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 09:06:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 09:06:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 09:06:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 09:06:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 09:06:57,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 09:06:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 09:06:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 09:06:57,195 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 09:06:57,197 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 09:06:57,411 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 09:06:57,428 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 09:06:57,428 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-21 09:06:57,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:06:57 BoogieIcfgContainer [2022-11-21 09:06:57,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 09:06:57,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 09:06:57,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 09:06:57,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 09:06:57,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:06:56" (1/3) ... [2022-11-21 09:06:57,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55593cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:06:57, skipping insertion in model container [2022-11-21 09:06:57,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:06:56" (2/3) ... [2022-11-21 09:06:57,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55593cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:06:57, skipping insertion in model container [2022-11-21 09:06:57,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:06:57" (3/3) ... [2022-11-21 09:06:57,443 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort-1-2.c [2022-11-21 09:06:57,465 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 09:06:57,466 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 09:06:57,524 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 09:06:57,532 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=PETRI_NET, 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;@48825008, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 09:06:57,533 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 09:06:57,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:06:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 09:06:57,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:06:57,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:06:57,548 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:06:57,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:06:57,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1491357889, now seen corresponding path program 1 times [2022-11-21 09:06:57,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:06:57,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806162771] [2022-11-21 09:06:57,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:06:57,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:06:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:06:57,775 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-21 09:06:57,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:06:57,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806162771] [2022-11-21 09:06:57,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806162771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:06:57,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:06:57,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 09:06:57,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504385993] [2022-11-21 09:06:57,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:06:57,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 09:06:57,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:06:57,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 09:06:57,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 09:06:57,826 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:06:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:06:57,847 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-11-21 09:06:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 09:06:57,849 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 09:06:57,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:06:57,859 INFO L225 Difference]: With dead ends: 45 [2022-11-21 09:06:57,860 INFO L226 Difference]: Without dead ends: 21 [2022-11-21 09:06:57,863 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-21 09:06:57,899 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 09:06:57,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:06:57,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-21 09:06:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-21 09:06:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:06:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-11-21 09:06:57,939 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 10 [2022-11-21 09:06:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:06:57,939 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-11-21 09:06:57,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:06:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-11-21 09:06:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-21 09:06:57,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:06:57,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:06:57,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 09:06:57,942 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:06:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:06:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1773554617, now seen corresponding path program 1 times [2022-11-21 09:06:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:06:57,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112705230] [2022-11-21 09:06:57,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:06:57,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:06:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:06:58,342 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-21 09:06:58,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:06:58,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112705230] [2022-11-21 09:06:58,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112705230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:06:58,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:06:58,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 09:06:58,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622480295] [2022-11-21 09:06:58,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:06:58,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 09:06:58,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:06:58,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 09:06:58,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 09:06:58,348 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:06:58,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:06:58,433 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-11-21 09:06:58,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 09:06:58,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-21 09:06:58,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:06:58,435 INFO L225 Difference]: With dead ends: 37 [2022-11-21 09:06:58,436 INFO L226 Difference]: Without dead ends: 29 [2022-11-21 09:06:58,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 09:06:58,438 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 09:06:58,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 58 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 09:06:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-21 09:06:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2022-11-21 09:06:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:06:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-11-21 09:06:58,447 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 10 [2022-11-21 09:06:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:06:58,447 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-11-21 09:06:58,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:06:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-11-21 09:06:58,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 09:06:58,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:06:58,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:06:58,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 09:06:58,450 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:06:58,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:06:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash 385530252, now seen corresponding path program 1 times [2022-11-21 09:06:58,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:06:58,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466409251] [2022-11-21 09:06:58,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:06:58,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:06:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:06:58,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:06:58,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:06:58,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466409251] [2022-11-21 09:06:58,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466409251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 09:06:58,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 09:06:58,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 09:06:58,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236298418] [2022-11-21 09:06:58,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 09:06:58,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 09:06:58,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:06:58,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 09:06:58,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 09:06:58,759 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:06:58,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:06:58,837 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-11-21 09:06:58,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 09:06:58,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 09:06:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:06:58,839 INFO L225 Difference]: With dead ends: 41 [2022-11-21 09:06:58,839 INFO L226 Difference]: Without dead ends: 24 [2022-11-21 09:06:58,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 09:06:58,842 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:06:58,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 74 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:06:58,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-21 09:06:58,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-11-21 09:06:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:06:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-11-21 09:06:58,850 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 16 [2022-11-21 09:06:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:06:58,850 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-11-21 09:06:58,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:06:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-11-21 09:06:58,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 09:06:58,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:06:58,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:06:58,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 09:06:58,853 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:06:58,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:06:58,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1021685782, now seen corresponding path program 1 times [2022-11-21 09:06:58,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:06:58,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218556816] [2022-11-21 09:06:58,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:06:58,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:06:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:06:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:06:59,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:06:59,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218556816] [2022-11-21 09:06:59,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218556816] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:06:59,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886900552] [2022-11-21 09:06:59,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:06:59,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:06:59,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:06:59,279 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:06:59,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 09:06:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:06:59,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 09:06:59,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:06:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:06:59,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:06:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:06:59,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886900552] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:06:59,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:06:59,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-21 09:06:59,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36483102] [2022-11-21 09:06:59,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:06:59,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 09:06:59,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:06:59,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 09:06:59,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-21 09:06:59,710 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:06:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:06:59,822 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-11-21 09:06:59,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 09:06:59,823 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-21 09:06:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:06:59,824 INFO L225 Difference]: With dead ends: 50 [2022-11-21 09:06:59,824 INFO L226 Difference]: Without dead ends: 33 [2022-11-21 09:06:59,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-21 09:06:59,826 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 09:06:59,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 113 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 09:06:59,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-21 09:06:59,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2022-11-21 09:06:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:06:59,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-11-21 09:06:59,834 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 18 [2022-11-21 09:06:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:06:59,834 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-11-21 09:06:59,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:06:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-11-21 09:06:59,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 09:06:59,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:06:59,836 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:06:59,844 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 09:07:00,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:07:00,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:07:00,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:07:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash -441596216, now seen corresponding path program 2 times [2022-11-21 09:07:00,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:07:00,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270375485] [2022-11-21 09:07:00,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:07:00,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:07:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:07:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:07:01,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:07:01,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270375485] [2022-11-21 09:07:01,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270375485] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:07:01,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248718581] [2022-11-21 09:07:01,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 09:07:01,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:07:01,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:07:01,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:07:01,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 09:07:01,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 09:07:01,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 09:07:01,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-21 09:07:01,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:07:01,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-21 09:07:02,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:07:02,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-11-21 09:07:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 09:07:02,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:07:02,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2022-11-21 09:07:02,419 INFO L321 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2022-11-21 09:07:02,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 82 [2022-11-21 09:07:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 09:07:02,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248718581] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:07:02,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:07:02,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 25 [2022-11-21 09:07:02,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421928639] [2022-11-21 09:07:02,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:07:02,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 09:07:02,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:07:02,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 09:07:02,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2022-11-21 09:07:02,594 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:05,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:07:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:07:05,970 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2022-11-21 09:07:05,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-21 09:07:05,971 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-21 09:07:05,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:07:05,972 INFO L225 Difference]: With dead ends: 98 [2022-11-21 09:07:05,972 INFO L226 Difference]: Without dead ends: 83 [2022-11-21 09:07:05,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=479, Invalid=1683, Unknown=0, NotChecked=0, Total=2162 [2022-11-21 09:07:05,974 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 165 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-21 09:07:05,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 153 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 407 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-21 09:07:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-21 09:07:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 39. [2022-11-21 09:07:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-11-21 09:07:06,005 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 20 [2022-11-21 09:07:06,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:07:06,006 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-11-21 09:07:06,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-11-21 09:07:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 09:07:06,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:07:06,009 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:07:06,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 09:07:06,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:07:06,216 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:07:06,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:07:06,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1096856990, now seen corresponding path program 1 times [2022-11-21 09:07:06,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:07:06,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964725467] [2022-11-21 09:07:06,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:07:06,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:07:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:07:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 09:07:06,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:07:06,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964725467] [2022-11-21 09:07:06,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964725467] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:07:06,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401815175] [2022-11-21 09:07:06,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:07:06,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:07:06,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:07:06,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:07:06,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 09:07:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:07:06,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 09:07:06,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:07:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 09:07:06,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:07:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 09:07:07,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401815175] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:07:07,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:07:07,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-11-21 09:07:07,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133797416] [2022-11-21 09:07:07,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:07:07,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 09:07:07,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:07:07,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 09:07:07,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-21 09:07:07,103 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:07,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:07:07,383 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2022-11-21 09:07:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 09:07:07,384 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-21 09:07:07,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:07:07,385 INFO L225 Difference]: With dead ends: 123 [2022-11-21 09:07:07,386 INFO L226 Difference]: Without dead ends: 87 [2022-11-21 09:07:07,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-11-21 09:07:07,390 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 113 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 09:07:07,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 173 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 09:07:07,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-21 09:07:07,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2022-11-21 09:07:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2022-11-21 09:07:07,411 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 24 [2022-11-21 09:07:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:07:07,411 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2022-11-21 09:07:07,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2022-11-21 09:07:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-21 09:07:07,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:07:07,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:07:07,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 09:07:07,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-21 09:07:07,620 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:07:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:07:07,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1110592866, now seen corresponding path program 1 times [2022-11-21 09:07:07,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:07:07,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13500682] [2022-11-21 09:07:07,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:07:07,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:07:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:07:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:07:08,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:07:08,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13500682] [2022-11-21 09:07:08,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13500682] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:07:08,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637858319] [2022-11-21 09:07:08,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:07:08,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:07:08,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:07:08,860 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:07:08,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 09:07:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:07:08,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 09:07:08,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:07:09,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2022-11-21 09:07:09,585 INFO L321 Elim1Store]: treesize reduction 73, result has 14.1 percent of original size [2022-11-21 09:07:09,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 33 [2022-11-21 09:07:09,867 INFO L321 Elim1Store]: treesize reduction 50, result has 12.3 percent of original size [2022-11-21 09:07:09,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 18 [2022-11-21 09:07:09,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 09:07:09,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:07:10,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2022-11-21 09:07:10,655 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 09:07:10,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 681 treesize of output 621 [2022-11-21 09:07:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 09:07:10,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637858319] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:07:10,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:07:10,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 12] total 38 [2022-11-21 09:07:10,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736051729] [2022-11-21 09:07:10,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:07:10,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-21 09:07:10,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:07:10,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-21 09:07:10,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1208, Unknown=0, NotChecked=0, Total=1406 [2022-11-21 09:07:10,991 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 38 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 38 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:07:27,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:07:29,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:07:31,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:07:36,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:07:38,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:07:40,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:07:42,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:07:44,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:07:46,484 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#v~0#1.base|))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_17| Int)) (or (forall ((v_ArrVal_78 Int)) (or (not (<= v_ArrVal_78 |c_ULTIMATE.start_main_~key~0#1|)) (let ((.cse0 (store .cse2 (+ (* |v_ULTIMATE.start_main_~i~0#1_17| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_78))) (< (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse0 .cse1) 1))))) (<= 0 |v_ULTIMATE.start_main_~i~0#1_17|) (not (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_17| 1))))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_78 Int)) (or (not (<= v_ArrVal_78 |c_ULTIMATE.start_main_~key~0#1|)) (let ((.cse3 (store .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_78))) (< (select .cse3 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse3 .cse1) 1))))) (let ((.cse4 (* 4 |c_ULTIMATE.start_main_~k~0#1|))) (<= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| (- 4) .cse4)) 1) (select .cse2 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| .cse4)))) (= |c_ULTIMATE.start_main_~k~0#1| 1) (= |c_ULTIMATE.start_main_~#v~0#1.offset| 0))) is different from false [2022-11-21 09:08:12,875 WARN L233 SmtUtils]: Spent 10.14s on a formula simplification. DAG size of input: 50 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:08:14,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:08:17,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:08:58,883 WARN L233 SmtUtils]: Spent 33.68s on a formula simplification. DAG size of input: 60 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:09:35,182 WARN L233 SmtUtils]: Spent 34.20s on a formula simplification. DAG size of input: 52 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:10:26,359 WARN L233 SmtUtils]: Spent 49.02s on a formula simplification. DAG size of input: 74 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:10:35,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:10:40,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:10:42,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:10:53,317 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#v~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_17| Int)) (or (forall ((v_ArrVal_78 Int)) (or (not (<= v_ArrVal_78 |c_ULTIMATE.start_main_~key~0#1|)) (let ((.cse0 (store .cse2 (+ (* |v_ULTIMATE.start_main_~i~0#1_17| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_78))) (< (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse0 .cse1) 1))))) (<= 0 |v_ULTIMATE.start_main_~i~0#1_17|) (not (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_17| 1))))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_78 Int)) (or (not (<= v_ArrVal_78 |c_ULTIMATE.start_main_~key~0#1|)) (let ((.cse3 (store .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_78))) (< (select .cse3 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse3 .cse1) 1))))) (< (select .cse2 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse2 .cse1) 1)) (= |c_ULTIMATE.start_main_~#v~0#1.offset| 0))) is different from false [2022-11-21 09:11:19,848 WARN L233 SmtUtils]: Spent 22.12s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:11:21,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:11:23,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:11:28,781 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 [1] [2022-11-21 09:11:33,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:11:41,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:12:09,984 WARN L233 SmtUtils]: Spent 24.14s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:12:17,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:12:34,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 09:12:36,693 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 [1] [2022-11-21 09:12:40,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:12:40,854 INFO L93 Difference]: Finished difference Result 215 states and 265 transitions. [2022-11-21 09:12:40,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-11-21 09:12:40,855 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 38 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-21 09:12:40,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:12:40,857 INFO L225 Difference]: With dead ends: 215 [2022-11-21 09:12:40,858 INFO L226 Difference]: Without dead ends: 148 [2022-11-21 09:12:40,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2965 ImplicationChecksByTransitivity, 285.8s TimeCoverageRelationStatistics Valid=1076, Invalid=7637, Unknown=37, NotChecked=370, Total=9120 [2022-11-21 09:12:40,863 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 250 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 88 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 45.3s IncrementalHoareTripleChecker+Time [2022-11-21 09:12:40,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 279 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 883 Invalid, 20 Unknown, 2 Unchecked, 45.3s Time] [2022-11-21 09:12:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-21 09:12:40,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 74. [2022-11-21 09:12:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:12:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2022-11-21 09:12:40,884 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 25 [2022-11-21 09:12:40,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:12:40,885 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2022-11-21 09:12:40,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 38 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:12:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2022-11-21 09:12:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 09:12:40,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:12:40,886 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:12:40,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 09:12:41,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:12:41,087 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:12:41,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:12:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash 868034105, now seen corresponding path program 3 times [2022-11-21 09:12:41,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:12:41,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145663716] [2022-11-21 09:12:41,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:12:41,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:12:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:12:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:12:42,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:12:42,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145663716] [2022-11-21 09:12:42,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145663716] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:12:42,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885791471] [2022-11-21 09:12:42,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 09:12:42,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:12:42,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:12:42,933 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:12:42,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 09:12:43,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-21 09:12:43,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 09:12:43,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-21 09:12:43,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:12:43,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2022-11-21 09:12:43,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:12:43,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:12:43,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:12:43,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2022-11-21 09:12:43,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:12:43,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-11-21 09:12:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 09:12:43,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:12:44,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2022-11-21 09:12:44,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:12:44,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 341 treesize of output 331 [2022-11-21 09:12:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 09:12:44,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885791471] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:12:44,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:12:44,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 30 [2022-11-21 09:12:44,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182918066] [2022-11-21 09:12:44,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:12:44,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-21 09:12:44,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:12:44,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-21 09:12:44,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-11-21 09:12:44,638 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 30 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:13:06,054 WARN L233 SmtUtils]: Spent 10.20s on a formula simplification. DAG size of input: 54 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:13:08,206 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 [1] [2022-11-21 09:13:10,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:13:12,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:13:26,511 WARN L233 SmtUtils]: Spent 10.15s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:13:28,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:13:40,923 WARN L233 SmtUtils]: Spent 10.22s on a formula simplification. DAG size of input: 63 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:13:53,172 WARN L233 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:14:06,242 WARN L233 SmtUtils]: Spent 6.70s on a formula simplification. DAG size of input: 65 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:14:08,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:14:45,115 WARN L233 SmtUtils]: Spent 34.64s on a formula simplification. DAG size of input: 59 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:14:47,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:14:49,155 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 [1] [2022-11-21 09:14:51,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:14:53,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:14:59,475 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 [1] [2022-11-21 09:15:01,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:15:03,573 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse4 (not (<= 0 |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#v~0#1.base|)) (.cse8 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| .cse6 4))) (and (or (forall ((v_ArrVal_105 Int)) (let ((.cse0 (store .cse2 .cse3 v_ArrVal_105))) (< (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse0 .cse1) 1)))) .cse4) (or (forall ((v_ArrVal_105 Int)) (let ((.cse5 (store .cse2 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| .cse6) v_ArrVal_105))) (< (select .cse5 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse5 .cse1) 1)))) (not (<= 1 |c_ULTIMATE.start_main_~j~0#1|))) (forall ((v_ArrVal_105 Int)) (let ((.cse7 (store .cse2 .cse8 v_ArrVal_105))) (< (select .cse7 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse7 .cse1) 1)))) (<= (select .cse2 0) (select .cse2 .cse1)) (or .cse4 (forall ((v_ArrVal_103 Int) (v_ArrVal_105 Int)) (or (let ((.cse9 (store (store .cse2 .cse8 v_ArrVal_103) .cse3 v_ArrVal_105))) (< (select .cse9 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse9 .cse1) 1))) (not (<= |c_ULTIMATE.start_main_~key~0#1| v_ArrVal_103))))) (= |c_ULTIMATE.start_main_~#v~0#1.offset| 0)))) is different from false [2022-11-21 09:15:05,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:15:13,774 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 [1] [2022-11-21 09:15:15,808 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 [1] [2022-11-21 09:15:17,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:15:26,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:15:30,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:15:32,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:15:34,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:15:42,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:15:50,961 WARN L233 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 57 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:15:53,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:15:55,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:16:13,455 WARN L233 SmtUtils]: Spent 14.24s on a formula simplification. DAG size of input: 56 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:16:15,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:16:17,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:16:19,805 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 [1] [2022-11-21 09:16:37,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:16:49,583 WARN L233 SmtUtils]: Spent 10.30s on a formula simplification. DAG size of input: 65 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:16:51,607 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 [1] [2022-11-21 09:16:53,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:16:55,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:17:00,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:17:02,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:17:08,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:17:12,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:17:14,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:17:16,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:17:18,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:17:29,307 WARN L233 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 59 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:17:31,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:17:33,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:17:35,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:17:37,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:17:39,612 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 [1] [2022-11-21 09:17:41,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:18:05,252 WARN L233 SmtUtils]: Spent 15.22s on a formula simplification. DAG size of input: 60 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 09:18:14,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:18:16,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:18:25,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:18:27,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:18:33,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:18:33,677 INFO L93 Difference]: Finished difference Result 397 states and 508 transitions. [2022-11-21 09:18:33,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-21 09:18:33,678 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 30 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-21 09:18:33,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:18:33,681 INFO L225 Difference]: With dead ends: 397 [2022-11-21 09:18:33,682 INFO L226 Difference]: Without dead ends: 349 [2022-11-21 09:18:33,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2720 ImplicationChecksByTransitivity, 254.2s TimeCoverageRelationStatistics Valid=1098, Invalid=6706, Unknown=32, NotChecked=174, Total=8010 [2022-11-21 09:18:33,687 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 630 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 151 mSolverCounterUnsat, 45 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 94.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 45 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 95.5s IncrementalHoareTripleChecker+Time [2022-11-21 09:18:33,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 312 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 912 Invalid, 45 Unknown, 20 Unchecked, 95.5s Time] [2022-11-21 09:18:33,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-21 09:18:33,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 106. [2022-11-21 09:18:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.3047619047619048) internal successors, (137), 105 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:18:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 137 transitions. [2022-11-21 09:18:33,722 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 137 transitions. Word has length 28 [2022-11-21 09:18:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:18:33,723 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 137 transitions. [2022-11-21 09:18:33,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 30 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:18:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2022-11-21 09:18:33,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-21 09:18:33,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:18:33,725 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:18:33,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-21 09:18:33,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:18:33,931 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:18:33,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:18:33,932 INFO L85 PathProgramCache]: Analyzing trace with hash 820049039, now seen corresponding path program 2 times [2022-11-21 09:18:33,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:18:33,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447340591] [2022-11-21 09:18:33,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:18:33,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:18:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:18:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:18:34,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:18:34,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447340591] [2022-11-21 09:18:34,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447340591] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:18:34,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56838684] [2022-11-21 09:18:34,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 09:18:34,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:18:34,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:18:34,927 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:18:34,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 09:18:35,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 09:18:35,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 09:18:35,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 09:18:35,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:18:35,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 09:18:35,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:18:35,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-11-21 09:18:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 09:18:35,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:18:38,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2022-11-21 09:18:38,069 INFO L321 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2022-11-21 09:18:38,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 68 [2022-11-21 09:18:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 09:18:38,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56838684] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 09:18:38,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 09:18:38,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 25 [2022-11-21 09:18:38,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975775932] [2022-11-21 09:18:38,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 09:18:38,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 09:18:38,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 09:18:38,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 09:18:38,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=513, Unknown=1, NotChecked=0, Total=600 [2022-11-21 09:18:38,148 INFO L87 Difference]: Start difference. First operand 106 states and 137 transitions. Second operand has 25 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:18:43,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:18:44,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:18:46,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:18:49,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:18:51,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 09:18:53,108 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 [1] [2022-11-21 09:19:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 09:19:04,865 INFO L93 Difference]: Finished difference Result 269 states and 339 transitions. [2022-11-21 09:19:04,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-21 09:19:04,865 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-21 09:19:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 09:19:04,867 INFO L225 Difference]: With dead ends: 269 [2022-11-21 09:19:04,867 INFO L226 Difference]: Without dead ends: 236 [2022-11-21 09:19:04,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=443, Invalid=2000, Unknown=7, NotChecked=0, Total=2450 [2022-11-21 09:19:04,869 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 315 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 29 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-11-21 09:19:04,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 358 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 652 Invalid, 5 Unknown, 0 Unchecked, 12.7s Time] [2022-11-21 09:19:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-21 09:19:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 156. [2022-11-21 09:19:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.3225806451612903) internal successors, (205), 155 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:19:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 205 transitions. [2022-11-21 09:19:04,931 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 205 transitions. Word has length 32 [2022-11-21 09:19:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 09:19:04,932 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 205 transitions. [2022-11-21 09:19:04,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 25 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 09:19:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 205 transitions. [2022-11-21 09:19:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-21 09:19:04,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 09:19:04,934 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 09:19:04,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 09:19:05,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:19:05,145 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 09:19:05,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 09:19:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash -923680109, now seen corresponding path program 2 times [2022-11-21 09:19:05,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 09:19:05,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150611132] [2022-11-21 09:19:05,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 09:19:05,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 09:19:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 09:19:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 09:19:06,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 09:19:06,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150611132] [2022-11-21 09:19:06,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150611132] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 09:19:06,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639611572] [2022-11-21 09:19:06,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 09:19:06,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 09:19:06,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 09:19:06,887 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 09:19:06,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed2896b3-a0b5-4f4e-89a9-e3fb721b87e1/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 09:19:06,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 09:19:06,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 09:19:06,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-21 09:19:06,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 09:19:07,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2022-11-21 09:19:07,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:19:07,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 09:19:07,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:19:07,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2022-11-21 09:19:07,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:19:07,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 09:19:07,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:19:07,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-21 09:19:08,058 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 09:19:08,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2022-11-21 09:19:08,102 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 09:19:08,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 09:19:21,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 81 [2022-11-21 09:19:21,656 INFO L321 Elim1Store]: treesize reduction 11, result has 47.6 percent of original size [2022-11-21 09:19:21,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41639 treesize of output 40101