./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s4if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/s4if.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8 --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 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 20:39:45,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:39:45,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:39:45,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:39:45,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:39:45,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:39:45,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:39:45,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:39:45,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:39:45,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:39:45,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:39:45,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:39:45,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:39:45,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:39:45,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:39:45,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:39:45,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:39:45,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:39:45,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:39:45,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:39:45,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:39:45,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:39:45,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:39:45,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:39:45,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:39:45,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:39:45,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:39:45,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:39:45,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:39:45,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:39:45,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:39:45,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:39:45,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:39:45,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:39:45,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:39:45,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:39:45,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:39:45,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:39:45,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:39:45,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:39:45,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:39:45,536 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 20:39:45,550 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:39:45,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:39:45,550 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:39:45,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:39:45,551 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:39:45,551 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:39:45,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:39:45,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:39:45,551 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:39:45,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:39:45,552 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:39:45,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:39:45,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:39:45,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:39:45,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:39:45,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:39:45,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:39:45,553 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:39:45,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:39:45,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:39:45,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:39:45,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:39:45,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:39:45,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:39:45,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:39:45,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:39:45,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:39:45,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:39:45,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:39:45,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:39:45,555 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:39:45,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:39:45,555 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:39:45,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:39:45,555 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:39:45,555 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/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_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8 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 -> 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e [2022-12-13 20:39:45,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:39:45,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:39:45,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:39:45,758 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:39:45,758 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:39:45,759 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/array-fpi/s4if.c [2022-12-13 20:39:48,401 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:39:48,567 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:39:48,568 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/sv-benchmarks/c/array-fpi/s4if.c [2022-12-13 20:39:48,573 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/data/7a30f40ce/59058cfe285748d294f285cc71ab09bc/FLAGc8bd07ae1 [2022-12-13 20:39:48,584 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/data/7a30f40ce/59058cfe285748d294f285cc71ab09bc [2022-12-13 20:39:48,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:39:48,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:39:48,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:39:48,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:39:48,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:39:48,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:39:48" (1/1) ... [2022-12-13 20:39:48,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534d9b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:48, skipping insertion in model container [2022-12-13 20:39:48,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:39:48" (1/1) ... [2022-12-13 20:39:48,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:39:48,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:39:48,750 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_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/sv-benchmarks/c/array-fpi/s4if.c[587,600] [2022-12-13 20:39:48,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:39:48,769 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:39:48,778 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_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/sv-benchmarks/c/array-fpi/s4if.c[587,600] [2022-12-13 20:39:48,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:39:48,792 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:39:48,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:48 WrapperNode [2022-12-13 20:39:48,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:39:48,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:39:48,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:39:48,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:39:48,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:48" (1/1) ... [2022-12-13 20:39:48,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:48" (1/1) ... [2022-12-13 20:39:48,818 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-12-13 20:39:48,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:39:48,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:39:48,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:39:48,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:39:48,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:48" (1/1) ... [2022-12-13 20:39:48,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:48" (1/1) ... [2022-12-13 20:39:48,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:48" (1/1) ... [2022-12-13 20:39:48,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:48" (1/1) ... [2022-12-13 20:39:48,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:48" (1/1) ... [2022-12-13 20:39:48,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:48" (1/1) ... [2022-12-13 20:39:48,835 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:48" (1/1) ... [2022-12-13 20:39:48,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:48" (1/1) ... [2022-12-13 20:39:48,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:39:48,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:39:48,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:39:48,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:39:48,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:48" (1/1) ... [2022-12-13 20:39:48,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:39:48,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:39:48,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:39:48,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:39:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:39:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:39:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:39:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:39:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 20:39:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:39:48,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:39:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 20:39:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:39:48,955 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:39:48,957 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:39:49,071 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:39:49,077 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:39:49,077 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 20:39:49,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:39:49 BoogieIcfgContainer [2022-12-13 20:39:49,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:39:49,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:39:49,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:39:49,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:39:49,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:39:48" (1/3) ... [2022-12-13 20:39:49,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff49a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:39:49, skipping insertion in model container [2022-12-13 20:39:49,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:39:48" (2/3) ... [2022-12-13 20:39:49,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff49a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:39:49, skipping insertion in model container [2022-12-13 20:39:49,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:39:49" (3/3) ... [2022-12-13 20:39:49,087 INFO L112 eAbstractionObserver]: Analyzing ICFG s4if.c [2022-12-13 20:39:49,102 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:39:49,102 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 20:39:49,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:39:49,143 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;@4696e13b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:39:49,143 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 20:39:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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-12-13 20:39:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 20:39:49,151 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:39:49,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:39:49,152 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:39:49,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:39:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2022-12-13 20:39:49,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:39:49,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424363213] [2022-12-13 20:39:49,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:49,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:39:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:49,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:39:49,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424363213] [2022-12-13 20:39:49,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424363213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:39:49,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:39:49,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:39:49,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400528735] [2022-12-13 20:39:49,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:39:49,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 20:39:49,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:39:49,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 20:39:49,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 20:39:49,328 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-12-13 20:39:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:39:49,342 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-12-13 20:39:49,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 20:39:49,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2022-12-13 20:39:49,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:39:49,351 INFO L225 Difference]: With dead ends: 34 [2022-12-13 20:39:49,351 INFO L226 Difference]: Without dead ends: 15 [2022-12-13 20:39:49,353 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-12-13 20:39:49,356 INFO L413 NwaCegarLoop]: 22 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, 22 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-12-13 20:39:49,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:39:49,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-12-13 20:39:49,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-12-13 20:39:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-12-13 20:39:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-12-13 20:39:49,379 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-12-13 20:39:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:39:49,380 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-12-13 20:39:49,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-12-13 20:39:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-12-13 20:39:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 20:39:49,381 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:39:49,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:39:49,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:39:49,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:39:49,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:39:49,382 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2022-12-13 20:39:49,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:39:49,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822863321] [2022-12-13 20:39:49,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:49,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:39:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:49,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:39:49,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822863321] [2022-12-13 20:39:49,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822863321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:39:49,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:39:49,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:39:49,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111874948] [2022-12-13 20:39:49,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:39:49,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:39:49,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:39:49,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:39:49,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:39:49,515 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-12-13 20:39:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:39:49,566 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-12-13 20:39:49,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:39:49,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-12-13 20:39:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:39:49,567 INFO L225 Difference]: With dead ends: 28 [2022-12-13 20:39:49,567 INFO L226 Difference]: Without dead ends: 20 [2022-12-13 20:39:49,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:39:49,568 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:39:49,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:39:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-12-13 20:39:49,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-12-13 20:39:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-12-13 20:39:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-12-13 20:39:49,572 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-12-13 20:39:49,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:39:49,572 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-12-13 20:39:49,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-12-13 20:39:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-12-13 20:39:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 20:39:49,579 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:39:49,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:39:49,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:39:49,580 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:39:49,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:39:49,580 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2022-12-13 20:39:49,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:39:49,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325927736] [2022-12-13 20:39:49,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:49,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:39:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:50,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:39:50,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325927736] [2022-12-13 20:39:50,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325927736] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:39:50,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622690320] [2022-12-13 20:39:50,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:50,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:39:50,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:39:50,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:39:50,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 20:39:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:50,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 20:39:50,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:39:50,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:39:50,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 20:39:50,212 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 14 treesize of output 16 [2022-12-13 20:39:50,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 20:39:50,362 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 0 case distinctions, treesize of input 47 treesize of output 27 [2022-12-13 20:39:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:50,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:39:50,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:39:50,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 72 [2022-12-13 20:39:50,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 20:39:50,716 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 66 treesize of output 54 [2022-12-13 20:39:50,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 20:39:50,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 20:39:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:50,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622690320] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:39:50,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:39:50,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2022-12-13 20:39:50,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651670411] [2022-12-13 20:39:50,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:39:50,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 20:39:50,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:39:50,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 20:39:50,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=269, Unknown=2, NotChecked=0, Total=342 [2022-12-13 20:39:50,736 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 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-12-13 20:39:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:39:51,624 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-12-13 20:39:51,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 20:39:51,625 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 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-12-13 20:39:51,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:39:51,625 INFO L225 Difference]: With dead ends: 39 [2022-12-13 20:39:51,625 INFO L226 Difference]: Without dead ends: 35 [2022-12-13 20:39:51,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=530, Unknown=2, NotChecked=0, Total=702 [2022-12-13 20:39:51,626 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 54 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 20:39:51,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 37 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 20:39:51,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-12-13 20:39:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2022-12-13 20:39:51,630 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-12-13 20:39:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-12-13 20:39:51,630 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2022-12-13 20:39:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:39:51,630 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-12-13 20:39:51,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 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-12-13 20:39:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-12-13 20:39:51,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 20:39:51,631 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:39:51,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:39:51,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:39:51,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-13 20:39:51,832 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:39:51,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:39:51,833 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2022-12-13 20:39:51,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:39:51,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404248827] [2022-12-13 20:39:51,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:39:51,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 20:39:51,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1026486168] [2022-12-13 20:39:51,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:51,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:39:51,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:39:51,846 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:39:51,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 20:39:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:51,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 20:39:51,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:39:51,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:39:51,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 20:39:51,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:51,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:39:51,967 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 14 treesize of output 12 [2022-12-13 20:39:51,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-13 20:39:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:51,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:39:51,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404248827] [2022-12-13 20:39:51,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 20:39:51,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026486168] [2022-12-13 20:39:51,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026486168] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:39:51,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:39:51,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-12-13 20:39:51,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145418124] [2022-12-13 20:39:51,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:39:51,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 20:39:51,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:39:51,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 20:39:51,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:39:51,981 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-12-13 20:39:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:39:52,030 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-12-13 20:39:52,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:39:52,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-12-13 20:39:52,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:39:52,031 INFO L225 Difference]: With dead ends: 38 [2022-12-13 20:39:52,031 INFO L226 Difference]: Without dead ends: 26 [2022-12-13 20:39:52,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:39:52,033 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:39:52,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:39:52,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-12-13 20:39:52,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-12-13 20:39:52,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 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-12-13 20:39:52,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-12-13 20:39:52,039 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-12-13 20:39:52,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:39:52,039 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-12-13 20:39:52,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-12-13 20:39:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-12-13 20:39:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 20:39:52,040 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:39:52,040 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:39:52,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 20:39:52,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:39:52,242 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:39:52,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:39:52,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2022-12-13 20:39:52,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:39:52,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715261504] [2022-12-13 20:39:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:39:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:52,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:39:52,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715261504] [2022-12-13 20:39:52,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715261504] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:39:52,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754494962] [2022-12-13 20:39:52,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:39:52,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:39:52,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:39:52,341 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:39:52,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 20:39:52,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:39:52,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:39:52,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:39:52,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:39:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:52,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:39:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:52,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754494962] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:39:52,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:39:52,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 20:39:52,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173933552] [2022-12-13 20:39:52,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:39:52,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:39:52,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:39:52,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:39:52,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:39:52,449 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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-12-13 20:39:52,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:39:52,532 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-12-13 20:39:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:39:52,532 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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) Word has length 18 [2022-12-13 20:39:52,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:39:52,533 INFO L225 Difference]: With dead ends: 33 [2022-12-13 20:39:52,533 INFO L226 Difference]: Without dead ends: 29 [2022-12-13 20:39:52,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-12-13 20:39:52,533 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:39:52,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 31 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:39:52,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-13 20:39:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-12-13 20:39:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-12-13 20:39:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-12-13 20:39:52,537 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-12-13 20:39:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:39:52,537 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-12-13 20:39:52,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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-12-13 20:39:52,537 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-12-13 20:39:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 20:39:52,541 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:39:52,541 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:39:52,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 20:39:52,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:39:52,743 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:39:52,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:39:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2022-12-13 20:39:52,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:39:52,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084651288] [2022-12-13 20:39:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:52,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:39:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:52,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:39:52,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084651288] [2022-12-13 20:39:52,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084651288] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:39:52,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250163834] [2022-12-13 20:39:52,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:39:52,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:39:52,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:39:52,848 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:39:52,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 20:39:52,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 20:39:52,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:39:52,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:39:52,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:39:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:52,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:39:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:52,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250163834] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:39:52,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:39:52,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 20:39:52,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541924472] [2022-12-13 20:39:52,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:39:52,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:39:52,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:39:52,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:39:52,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:39:52,972 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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-12-13 20:39:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:39:53,038 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-12-13 20:39:53,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:39:53,038 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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 19 [2022-12-13 20:39:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:39:53,039 INFO L225 Difference]: With dead ends: 37 [2022-12-13 20:39:53,039 INFO L226 Difference]: Without dead ends: 25 [2022-12-13 20:39:53,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:39:53,039 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:39:53,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 30 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:39:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-13 20:39:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-12-13 20:39:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-12-13 20:39:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-12-13 20:39:53,043 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-12-13 20:39:53,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:39:53,043 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-12-13 20:39:53,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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-12-13 20:39:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-12-13 20:39:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 20:39:53,044 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:39:53,044 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:39:53,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 20:39:53,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 20:39:53,246 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:39:53,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:39:53,246 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2022-12-13 20:39:53,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:39:53,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544004895] [2022-12-13 20:39:53,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:53,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:39:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:53,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:39:53,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544004895] [2022-12-13 20:39:53,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544004895] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:39:53,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752401734] [2022-12-13 20:39:53,658 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 20:39:53,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:39:53,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:39:53,659 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:39:53,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 20:39:53,710 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 20:39:53,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:39:53,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 20:39:53,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:39:53,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:39:53,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 20:39:53,750 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 14 treesize of output 16 [2022-12-13 20:39:53,779 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 14 treesize of output 16 [2022-12-13 20:39:53,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 20:39:54,067 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:39:54,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-12-13 20:39:54,210 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:39:54,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2022-12-13 20:39:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:39:54,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:39:57,319 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)))) (.cse3 (* |v_ULTIMATE.start_main_~i~0#1_42| 4))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (or (< (+ .cse0 .cse1 .cse2) (+ 5 .cse3)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse2 4)) (not (= .cse0 4)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_42|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (< (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 3) (+ .cse6 .cse7 .cse8)) (not (= .cse8 4)) (not (= .cse6 4)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_42|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|))))))))) is different from false [2022-12-13 20:39:57,382 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)))) (.cse3 (* |v_ULTIMATE.start_main_~i~0#1_42| 4))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (or (< (+ .cse0 .cse1 .cse2) (+ 5 .cse3)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse2 4)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_42|) (not (= .cse0 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse7 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (< (+ 7 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (+ .cse7 .cse8 .cse9)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse9 4)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_42|) (not (= .cse7 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))))) is different from false [2022-12-13 20:39:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-13 20:39:57,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752401734] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:39:57,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:39:57,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 35 [2022-12-13 20:39:57,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638878539] [2022-12-13 20:39:57,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:39:57,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 20:39:57,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:39:57,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 20:39:57,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=935, Unknown=3, NotChecked=126, Total=1190 [2022-12-13 20:39:57,448 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 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-12-13 20:40:05,403 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-12-13 20:40:07,541 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-12-13 20:40:09,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:40:12,307 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-12-13 20:40:14,533 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-12-13 20:40:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:20,602 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-12-13 20:40:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 20:40:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 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 21 [2022-12-13 20:40:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:20,605 INFO L225 Difference]: With dead ends: 52 [2022-12-13 20:40:20,605 INFO L226 Difference]: Without dead ends: 41 [2022-12-13 20:40:20,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=359, Invalid=2398, Unknown=7, NotChecked=206, Total=2970 [2022-12-13 20:40:20,607 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 40 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 49 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:20,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 83 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 501 Invalid, 4 Unknown, 71 Unchecked, 11.4s Time] [2022-12-13 20:40:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-12-13 20:40:20,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-12-13 20:40:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 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-12-13 20:40:20,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-12-13 20:40:20,615 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 21 [2022-12-13 20:40:20,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:20,616 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-12-13 20:40:20,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 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-12-13 20:40:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-12-13 20:40:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 20:40:20,616 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:20,617 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:20,621 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 20:40:20,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 20:40:20,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:20,819 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2022-12-13 20:40:20,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:20,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292292721] [2022-12-13 20:40:20,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:20,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:20,859 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 20:40:20,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1881961235] [2022-12-13 20:40:20,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:20,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:20,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:40:20,862 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:40:20,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 20:40:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:20,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 20:40:20,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:40:20,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 20:40:21,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:40:21,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 20:40:21,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 20:40:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:40:21,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:40:21,148 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:40:21,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-13 20:40:21,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:40:21,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-12-13 20:40:21,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:40:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:40:21,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:21,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292292721] [2022-12-13 20:40:21,196 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 20:40:21,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881961235] [2022-12-13 20:40:21,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881961235] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:40:21,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:40:21,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-12-13 20:40:21,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701265507] [2022-12-13 20:40:21,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:40:21,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 20:40:21,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:21,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 20:40:21,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=166, Unknown=4, NotChecked=0, Total=210 [2022-12-13 20:40:21,198 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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-12-13 20:40:21,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:21,353 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2022-12-13 20:40:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 20:40:21,354 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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 21 [2022-12-13 20:40:21,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:21,354 INFO L225 Difference]: With dead ends: 52 [2022-12-13 20:40:21,354 INFO L226 Difference]: Without dead ends: 40 [2022-12-13 20:40:21,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=268, Unknown=4, NotChecked=0, Total=342 [2022-12-13 20:40:21,355 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:21,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 63 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:40:21,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-13 20:40:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-12-13 20:40:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 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-12-13 20:40:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-12-13 20:40:21,365 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 21 [2022-12-13 20:40:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:21,365 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-12-13 20:40:21,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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-12-13 20:40:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-12-13 20:40:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 20:40:21,366 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:21,366 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:21,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 20:40:21,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:21,568 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:21,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:21,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2022-12-13 20:40:21,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:21,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955146354] [2022-12-13 20:40:21,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:21,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:40:21,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:21,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955146354] [2022-12-13 20:40:21,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955146354] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:40:21,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254788231] [2022-12-13 20:40:21,694 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 20:40:21,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:21,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:40:21,695 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:40:21,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 20:40:21,745 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 20:40:21,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:40:21,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 20:40:21,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:40:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:40:21,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:40:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:40:21,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254788231] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:40:21,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:40:21,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-13 20:40:21,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376059710] [2022-12-13 20:40:21,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:40:21,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 20:40:21,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:21,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 20:40:21,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-13 20:40:21,859 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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-12-13 20:40:22,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:22,011 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-12-13 20:40:22,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 20:40:22,012 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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 23 [2022-12-13 20:40:22,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:22,012 INFO L225 Difference]: With dead ends: 47 [2022-12-13 20:40:22,012 INFO L226 Difference]: Without dead ends: 43 [2022-12-13 20:40:22,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-12-13 20:40:22,013 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:22,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 28 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:40:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-13 20:40:22,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-12-13 20:40:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 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-12-13 20:40:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-12-13 20:40:22,024 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2022-12-13 20:40:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:22,024 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-12-13 20:40:22,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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-12-13 20:40:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-12-13 20:40:22,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 20:40:22,025 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:22,025 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:22,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 20:40:22,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:22,227 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:22,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:22,228 INFO L85 PathProgramCache]: Analyzing trace with hash -981578845, now seen corresponding path program 2 times [2022-12-13 20:40:22,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:22,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412282123] [2022-12-13 20:40:22,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:22,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:22,256 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 20:40:22,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1875337142] [2022-12-13 20:40:22,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:40:22,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:22,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:40:22,260 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:40:22,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 20:40:22,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:40:22,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:40:22,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 20:40:22,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:40:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:40:22,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:40:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:40:22,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:22,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412282123] [2022-12-13 20:40:22,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 20:40:22,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875337142] [2022-12-13 20:40:22,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875337142] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:40:22,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:40:22,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-12-13 20:40:22,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403942636] [2022-12-13 20:40:22,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:40:22,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 20:40:22,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:22,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 20:40:22,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 20:40:22,512 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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-12-13 20:40:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:22,602 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-12-13 20:40:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:40:22,602 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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-12-13 20:40:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:22,602 INFO L225 Difference]: With dead ends: 51 [2022-12-13 20:40:22,602 INFO L226 Difference]: Without dead ends: 30 [2022-12-13 20:40:22,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-12-13 20:40:22,603 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:22,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:40:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-12-13 20:40:22,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-12-13 20:40:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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-12-13 20:40:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-12-13 20:40:22,607 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2022-12-13 20:40:22,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:22,607 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-12-13 20:40:22,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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-12-13 20:40:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-12-13 20:40:22,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 20:40:22,607 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:22,607 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:40:22,611 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 20:40:22,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 20:40:22,809 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:22,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:22,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 6 times [2022-12-13 20:40:22,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:22,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170082103] [2022-12-13 20:40:22,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:40:23,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:23,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170082103] [2022-12-13 20:40:23,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170082103] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:40:23,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900634094] [2022-12-13 20:40:23,464 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 20:40:23,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:23,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:40:23,465 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:40:23,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 20:40:23,521 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-13 20:40:23,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:40:23,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 20:40:23,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:40:23,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:40:23,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:40:23,558 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 14 treesize of output 16 [2022-12-13 20:40:23,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:40:23,595 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 14 treesize of output 16 [2022-12-13 20:40:23,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:40:23,636 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 14 treesize of output 16 [2022-12-13 20:40:23,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:40:23,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 20:40:23,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:40:23,980 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:40:23,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-12-13 20:40:24,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:40:24,183 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-12-13 20:40:24,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 55 [2022-12-13 20:40:24,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:40:24,326 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-12-13 20:40:24,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 33 [2022-12-13 20:40:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:40:24,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:40:30,589 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4)))) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_83| 4))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse4)))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse0)) (< (+ .cse1 .cse2 .cse3 .cse0) (+ 5 .cse4)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse2 4)) (not (= .cse1 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4))))) (let ((.cse8 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse7)) (< (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 3) (+ .cse8 .cse9 .cse10 .cse7)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse9 4)) (not (= .cse8 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|)))))))))) is different from false [2022-12-13 20:40:30,691 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse0)) (< (+ 7 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (+ .cse1 .cse2 .cse3 .cse0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (= .cse2 4)) (not (= .cse1 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4)))) (.cse11 (* |v_ULTIMATE.start_main_~i~0#1_83| 4))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse11)))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse7)) (< (+ .cse8 .cse9 .cse10 .cse7) (+ 5 .cse11)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (= .cse9 4)) (not (= .cse8 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))))) is different from false [2022-12-13 20:40:30,892 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse0)) (< (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 11) (+ .cse1 .cse2 .cse3 .cse0)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse2 4)) (not (= .cse1 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4)))) (.cse11 (* |v_ULTIMATE.start_main_~i~0#1_83| 4))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse11)))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse7)) (< (+ .cse8 .cse9 .cse10 .cse7) (+ 5 .cse11)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse9 4)) (not (= .cse8 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))))) is different from false [2022-12-13 20:40:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-12-13 20:40:31,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900634094] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:40:31,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:40:31,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 47 [2022-12-13 20:40:31,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138321147] [2022-12-13 20:40:31,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:40:31,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-13 20:40:31,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:31,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-13 20:40:31,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1721, Unknown=4, NotChecked=258, Total=2162 [2022-12-13 20:40:31,006 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 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-12-13 20:40:52,979 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-12-13 20:40:55,689 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-12-13 20:40:57,711 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-12-13 20:40:59,754 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-12-13 20:41:11,852 WARN L233 SmtUtils]: Spent 5.86s on a formula simplification. DAG size of input: 161 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:41:13,939 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-12-13 20:41:16,248 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-12-13 20:41:18,319 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-12-13 20:41:24,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-12-13 20:41:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:41:32,785 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-12-13 20:41:32,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 20:41:32,786 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 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 26 [2022-12-13 20:41:32,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:41:32,786 INFO L225 Difference]: With dead ends: 70 [2022-12-13 20:41:32,786 INFO L226 Difference]: Without dead ends: 59 [2022-12-13 20:41:32,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 50.4s TimeCoverageRelationStatistics Valid=669, Invalid=5338, Unknown=11, NotChecked=462, Total=6480 [2022-12-13 20:41:32,788 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 69 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 94 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2022-12-13 20:41:32,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 93 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 713 Invalid, 7 Unknown, 134 Unchecked, 17.8s Time] [2022-12-13 20:41:32,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-12-13 20:41:32,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-12-13 20:41:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 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-12-13 20:41:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2022-12-13 20:41:32,796 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 26 [2022-12-13 20:41:32,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:41:32,797 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2022-12-13 20:41:32,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 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-12-13 20:41:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-12-13 20:41:32,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 20:41:32,797 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:41:32,797 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:41:32,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 20:41:32,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 20:41:32,999 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:41:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:41:33,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 3 times [2022-12-13 20:41:33,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:41:33,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149921918] [2022-12-13 20:41:33,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:41:33,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:41:33,014 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 20:41:33,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1274306576] [2022-12-13 20:41:33,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:41:33,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:41:33,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:41:33,015 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:41:33,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 20:41:33,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 20:41:33,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:41:33,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 20:41:33,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:41:33,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 20:41:33,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:41:33,180 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 18 treesize of output 20 [2022-12-13 20:41:33,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:41:33,215 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 18 treesize of output 20 [2022-12-13 20:41:33,247 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:41:33,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-12-13 20:41:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 20:41:33,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:41:33,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:41:33,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-13 20:41:33,516 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-13 20:41:33,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2022-12-13 20:41:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 20:41:35,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:41:35,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149921918] [2022-12-13 20:41:35,539 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 20:41:35,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274306576] [2022-12-13 20:41:35,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274306576] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:41:35,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:41:35,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-12-13 20:41:35,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638121077] [2022-12-13 20:41:35,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:41:35,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 20:41:35,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:41:35,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 20:41:35,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=174, Unknown=4, NotChecked=0, Total=240 [2022-12-13 20:41:35,541 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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-12-13 20:41:35,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:41:35,717 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-12-13 20:41:35,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 20:41:35,717 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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 26 [2022-12-13 20:41:35,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:41:35,718 INFO L225 Difference]: With dead ends: 59 [2022-12-13 20:41:35,718 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 20:41:35,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=120, Invalid=256, Unknown=4, NotChecked=0, Total=380 [2022-12-13 20:41:35,719 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:41:35,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 23 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:41:35,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 20:41:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-12-13 20:41:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 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-12-13 20:41:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2022-12-13 20:41:35,728 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 26 [2022-12-13 20:41:35,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:41:35,729 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2022-12-13 20:41:35,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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-12-13 20:41:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-12-13 20:41:35,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 20:41:35,729 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:41:35,729 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:41:35,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 20:41:35,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 20:41:35,931 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:41:35,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:41:35,932 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 7 times [2022-12-13 20:41:35,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:41:35,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503882432] [2022-12-13 20:41:35,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:41:35,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:41:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:41:36,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:41:36,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503882432] [2022-12-13 20:41:36,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503882432] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:41:36,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557170965] [2022-12-13 20:41:36,072 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 20:41:36,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:41:36,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:41:36,073 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:41:36,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 20:41:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:36,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 20:41:36,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:41:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:41:36,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:41:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:41:36,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557170965] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:41:36,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:41:36,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-12-13 20:41:36,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672721370] [2022-12-13 20:41:36,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:41:36,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 20:41:36,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:41:36,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 20:41:36,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-12-13 20:41:36,241 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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-12-13 20:41:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:41:36,413 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-12-13 20:41:36,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 20:41:36,413 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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-12-13 20:41:36,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:41:36,414 INFO L225 Difference]: With dead ends: 69 [2022-12-13 20:41:36,414 INFO L226 Difference]: Without dead ends: 65 [2022-12-13 20:41:36,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-12-13 20:41:36,414 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:41:36,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 34 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:41:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-13 20:41:36,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2022-12-13 20:41:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 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-12-13 20:41:36,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-12-13 20:41:36,424 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 28 [2022-12-13 20:41:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:41:36,425 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-12-13 20:41:36,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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-12-13 20:41:36,425 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-12-13 20:41:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 20:41:36,425 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:41:36,425 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:41:36,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 20:41:36,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:41:36,627 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:41:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:41:36,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 8 times [2022-12-13 20:41:36,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:41:36,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781650970] [2022-12-13 20:41:36,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:41:36,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:41:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:41:37,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:41:37,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781650970] [2022-12-13 20:41:37,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781650970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:41:37,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797167759] [2022-12-13 20:41:37,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:41:37,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:41:37,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:41:37,397 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:41:37,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 20:41:37,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:41:37,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:41:37,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-13 20:41:37,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:41:37,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:41:37,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:41:37,493 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 14 treesize of output 16 [2022-12-13 20:41:37,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:41:37,535 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 14 treesize of output 16 [2022-12-13 20:41:37,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:41:37,584 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 14 treesize of output 16 [2022-12-13 20:41:37,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:41:37,623 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 14 treesize of output 16 [2022-12-13 20:41:37,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:41:37,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 20:41:37,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:41:37,927 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:41:37,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-12-13 20:41:38,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:41:38,087 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:41:38,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-12-13 20:41:38,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:41:38,228 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:41:38,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 43 [2022-12-13 20:41:38,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:41:38,332 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:41:38,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2022-12-13 20:41:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:41:38,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:41:45,791 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_443 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (< (+ .cse0 3) (+ .cse1 .cse2 .cse3 .cse4 .cse5)) (not (= 4 .cse5)) (not (= .cse4 4)) (not (= .cse3 4)) (not (= .cse2 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_129| Int) (v_subst_1 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse8 4)) (< (+ .cse9 .cse10 .cse11 .cse12 .cse8) (+ 5 .cse0)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= .cse10 4)))))))))))) is different from false [2022-12-13 20:41:45,893 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_443 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse2 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= 4 .cse0)) (not (= .cse1 4)) (not (= .cse2 4)) (< (+ 7 .cse3) (+ .cse4 .cse5 .cse2 .cse1 .cse0)) (not (= .cse5 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_129| Int) (v_subst_1 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse8 4)) (< (+ .cse9 .cse10 .cse11 .cse12 .cse8) (+ .cse3 9)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= .cse10 4)))))))))))) is different from false [2022-12-13 20:41:46,079 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_129| Int) (v_subst_1 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse0 4)) (< (+ .cse1 .cse2 .cse3 .cse4 .cse0) (+ .cse5 13)) (not (= .cse3 4)) (not (= .cse4 4)) (not (= .cse2 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_443 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= 4 .cse8)) (not (= .cse9 4)) (not (= .cse10 4)) (< (+ .cse5 11) (+ .cse11 .cse12 .cse10 .cse9 .cse8)) (not (= .cse12 4)))))))))))) is different from false [2022-12-13 20:41:46,284 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_129| Int) (v_subst_1 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ .cse2 .cse3 .cse1 .cse4 .cse0) (+ .cse5 17)) (not (= .cse4 4)) (not (= .cse3 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_443 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= 4 .cse8)) (not (= .cse9 4)) (< (+ .cse5 15) (+ .cse10 .cse11 .cse12 .cse9 .cse8)) (not (= .cse12 4)) (not (= .cse11 4)))))))))))) is different from false [2022-12-13 20:41:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-12-13 20:41:46,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797167759] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:41:46,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:41:46,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 52 [2022-12-13 20:41:46,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232136358] [2022-12-13 20:41:46,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:41:46,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-13 20:41:46,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:41:46,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-13 20:41:46,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2085, Unknown=5, NotChecked=380, Total=2652 [2022-12-13 20:41:46,401 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 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-12-13 20:42:00,579 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-12-13 20:42:10,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=true, quantifiers [1] [2022-12-13 20:42:22,316 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-12-13 20:42:24,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-12-13 20:42:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:42:24,664 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-12-13 20:42:24,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 20:42:24,665 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 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 31 [2022-12-13 20:42:24,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:42:24,665 INFO L225 Difference]: With dead ends: 78 [2022-12-13 20:42:24,665 INFO L226 Difference]: Without dead ends: 74 [2022-12-13 20:42:24,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=324, Invalid=3716, Unknown=8, NotChecked=508, Total=4556 [2022-12-13 20:42:24,667 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 33 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-12-13 20:42:24,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 124 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 971 Invalid, 4 Unknown, 159 Unchecked, 11.8s Time] [2022-12-13 20:42:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-12-13 20:42:24,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2022-12-13 20:42:24,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 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-12-13 20:42:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-12-13 20:42:24,683 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 31 [2022-12-13 20:42:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:42:24,683 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-12-13 20:42:24,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 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-12-13 20:42:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-12-13 20:42:24,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 20:42:24,684 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:42:24,684 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:42:24,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 20:42:24,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:42:24,886 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:42:24,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:42:24,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1338916473, now seen corresponding path program 4 times [2022-12-13 20:42:24,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:42:24,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530769891] [2022-12-13 20:42:24,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:42:24,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:42:24,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 20:42:24,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1495740133] [2022-12-13 20:42:24,925 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 20:42:24,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:42:24,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:42:24,927 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:42:24,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 20:42:24,995 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 20:42:24,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:42:24,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 20:42:24,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:42:25,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 20:42:25,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 20:42:25,035 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-12-13 20:42:25,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 20:42:25,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-13 20:42:25,261 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 31 treesize of output 31 [2022-12-13 20:42:25,332 INFO L321 Elim1Store]: treesize reduction 14, result has 60.0 percent of original size [2022-12-13 20:42:25,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 31 [2022-12-13 20:42:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 20:42:25,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:42:25,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:42:25,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 51 [2022-12-13 20:42:25,982 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-12-13 20:42:25,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 50 [2022-12-13 20:42:25,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-12-13 20:42:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:42:26,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:42:26,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530769891] [2022-12-13 20:42:26,056 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 20:42:26,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495740133] [2022-12-13 20:42:26,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495740133] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:42:26,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:42:26,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 34 [2022-12-13 20:42:26,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584700599] [2022-12-13 20:42:26,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:42:26,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 20:42:26,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:42:26,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 20:42:26,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=913, Unknown=1, NotChecked=0, Total=1122 [2022-12-13 20:42:26,057 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 34 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 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-12-13 20:42:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:42:31,855 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2022-12-13 20:42:31,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-13 20:42:31,856 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 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 31 [2022-12-13 20:42:31,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:42:31,856 INFO L225 Difference]: With dead ends: 123 [2022-12-13 20:42:31,856 INFO L226 Difference]: Without dead ends: 119 [2022-12-13 20:42:31,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1353, Invalid=5287, Unknown=2, NotChecked=0, Total=6642 [2022-12-13 20:42:31,858 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 209 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 20:42:31,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 52 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 20:42:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-13 20:42:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 61. [2022-12-13 20:42:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 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-12-13 20:42:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-12-13 20:42:31,873 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 31 [2022-12-13 20:42:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:42:31,873 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-12-13 20:42:31,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 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-12-13 20:42:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-12-13 20:42:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 20:42:31,873 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:42:31,873 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:42:31,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 20:42:32,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 20:42:32,075 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:42:32,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:42:32,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 9 times [2022-12-13 20:42:32,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:42:32,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58368790] [2022-12-13 20:42:32,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:42:32,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:42:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:42:32,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:42:32,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58368790] [2022-12-13 20:42:32,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58368790] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:42:32,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176358076] [2022-12-13 20:42:32,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:42:32,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:42:32,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:42:32,233 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:42:32,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 20:42:32,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-13 20:42:32,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:42:32,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 20:42:32,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:42:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:42:32,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:42:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:42:32,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176358076] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:42:32,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:42:32,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-12-13 20:42:32,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176182195] [2022-12-13 20:42:32,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:42:32,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 20:42:32,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:42:32,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 20:42:32,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-12-13 20:42:32,525 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 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-12-13 20:42:32,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:42:32,908 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-12-13 20:42:32,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 20:42:32,909 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 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 33 [2022-12-13 20:42:32,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:42:32,909 INFO L225 Difference]: With dead ends: 100 [2022-12-13 20:42:32,909 INFO L226 Difference]: Without dead ends: 96 [2022-12-13 20:42:32,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-12-13 20:42:32,910 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:42:32,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 36 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 20:42:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-13 20:42:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 53. [2022-12-13 20:42:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 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-12-13 20:42:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2022-12-13 20:42:32,929 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 33 [2022-12-13 20:42:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:42:32,929 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2022-12-13 20:42:32,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 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-12-13 20:42:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2022-12-13 20:42:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 20:42:32,930 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:42:32,930 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:42:32,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 20:42:33,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 20:42:33,131 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:42:33,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:42:33,132 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 10 times [2022-12-13 20:42:33,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:42:33,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739237361] [2022-12-13 20:42:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:42:33,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:42:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:42:33,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:42:33,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739237361] [2022-12-13 20:42:33,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739237361] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:42:33,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512932136] [2022-12-13 20:42:33,351 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 20:42:33,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:42:33,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:42:33,352 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:42:33,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 20:42:33,425 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 20:42:33,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:42:33,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 20:42:33,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:42:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:42:33,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:42:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:42:33,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512932136] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:42:33,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:42:33,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-12-13 20:42:33,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589974547] [2022-12-13 20:42:33,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:42:33,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 20:42:33,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:42:33,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 20:42:33,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-12-13 20:42:33,620 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 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-12-13 20:42:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:42:33,850 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-12-13 20:42:33,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 20:42:33,850 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 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 34 [2022-12-13 20:42:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:42:33,851 INFO L225 Difference]: With dead ends: 101 [2022-12-13 20:42:33,851 INFO L226 Difference]: Without dead ends: 50 [2022-12-13 20:42:33,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2022-12-13 20:42:33,852 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 57 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:42:33,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 40 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:42:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-12-13 20:42:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2022-12-13 20:42:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 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-12-13 20:42:33,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-12-13 20:42:33,861 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 34 [2022-12-13 20:42:33,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:42:33,862 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-12-13 20:42:33,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 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-12-13 20:42:33,862 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-12-13 20:42:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 20:42:33,862 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:42:33,862 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:42:33,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 20:42:34,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 20:42:34,064 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:42:34,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:42:34,065 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 11 times [2022-12-13 20:42:34,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:42:34,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936134791] [2022-12-13 20:42:34,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:42:34,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:42:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:42:34,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:42:34,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936134791] [2022-12-13 20:42:34,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936134791] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:42:34,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908397705] [2022-12-13 20:42:35,000 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 20:42:35,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:42:35,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:42:35,001 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:42:35,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 20:42:35,091 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-12-13 20:42:35,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:42:35,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-13 20:42:35,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:42:35,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:42:35,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 20:42:35,135 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 14 treesize of output 16 [2022-12-13 20:42:35,171 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 14 treesize of output 16 [2022-12-13 20:42:35,205 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 14 treesize of output 16 [2022-12-13 20:42:35,253 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 14 treesize of output 16 [2022-12-13 20:42:35,297 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 14 treesize of output 16 [2022-12-13 20:42:35,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 20:42:35,612 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 20:42:35,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 37 [2022-12-13 20:42:35,834 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 20:42:35,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 51 [2022-12-13 20:42:36,090 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-12-13 20:42:36,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 66 [2022-12-13 20:42:36,442 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 20:42:36,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 77 [2022-12-13 20:42:38,910 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 20:42:38,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 89 treesize of output 41 [2022-12-13 20:42:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:42:38,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:44:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 44 refuted. 16 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:44:39,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908397705] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:44:39,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:44:39,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 72 [2022-12-13 20:44:39,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280005255] [2022-12-13 20:44:39,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:44:39,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-12-13 20:44:39,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:44:39,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-12-13 20:44:39,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=4559, Unknown=153, NotChecked=0, Total=5112 [2022-12-13 20:44:39,010 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 72 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 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-12-13 20:45:13,099 WARN L233 SmtUtils]: Spent 12.10s on a formula simplification. DAG size of input: 162 DAG size of output: 133 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:45:13,527 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse34 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse33 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse21 (+ .cse33 8)) (.cse20 (* c_~N~0 4)) (.cse17 (+ |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse32 (select .cse34 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse29 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (<= 5 c_~N~0) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (not (= .cse0 4)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse1) (not (= 4 .cse2)) (< (+ .cse3 .cse0 .cse4 .cse5 .cse6 .cse2) (+ .cse7 13)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse3 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse5 4)) (not (= .cse4 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse15 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse14 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse15 .cse16 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse12 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse10 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse15 .cse16 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse12)))) (or (not (= .cse10 4)) (not (= 4 .cse11)) (< (+ 3 .cse12) (+ .cse13 .cse10 .cse14 .cse15 .cse16 .cse11)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse17) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse13 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse15 4)) (not (= .cse14 4))))))))))) (<= .cse20 .cse21) (<= .cse21 .cse20) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse23 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse27 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse28 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse26 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse27 .cse28 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse24 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse22 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27 .cse28 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse24)))) (or (not (= .cse22 4)) (not (= 4 .cse23)) (< (+ 3 .cse24) (+ .cse25 .cse22 .cse26 .cse27 .cse28 .cse23)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse25 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse29) (not (= .cse27 4)) (not (= .cse26 4))))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse32 4) (= .cse33 (+ .cse32 8)) (= (select .cse34 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (<= |c_ULTIMATE.start_main_~i~0#1| 3) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse35 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse40 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse38 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse39 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse37 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse38 .cse39 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse36 (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse37 .cse38 .cse39 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (< (+ .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (+ .cse7 21)) (not (= .cse36 4)) (not (= 4 .cse40)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse17) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse35 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse38 4)) (not (= .cse37 4))))))))))) (= (+ .cse32 4 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse33) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse48 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse44 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse47 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse48 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse46 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse47 .cse48 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse43 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46 .cse47 .cse48 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (not (= .cse43 4)) (not (= 4 .cse44)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse45 4)) (< (+ .cse45 .cse43 .cse46 .cse47 .cse48 .cse44) (+ .cse7 17)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse29) (not (= .cse47 4)) (not (= .cse46 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse59 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse57 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse52 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse56 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse57 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse55 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse56 .cse57 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse53 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse51 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55 .cse56 .cse57 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse53)))) (or (not (= .cse51 4)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse1) (not (= 4 .cse52)) (< (+ 3 .cse53) (+ .cse54 .cse51 .cse55 .cse56 .cse57 .cse52)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse54 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse56 4)) (not (= .cse55 4)))))))))))))) is different from false [2022-12-13 20:45:15,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:45:17,364 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-12-13 20:45:19,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:45:21,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:45:24,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:45:27,170 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-12-13 20:45:33,705 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse17 (+ |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse30 (select .cse32 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse31 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse27 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (<= 5 c_~N~0) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (not (= .cse0 4)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse1) (not (= 4 .cse2)) (< (+ .cse3 .cse0 .cse4 .cse5 .cse6 .cse2) (+ .cse7 13)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse3 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse5 4)) (not (= .cse4 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse15 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse14 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse15 .cse16 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse12 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse10 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse15 .cse16 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse12)))) (or (not (= .cse10 4)) (not (= 4 .cse11)) (< (+ 3 .cse12) (+ .cse13 .cse10 .cse14 .cse15 .cse16 .cse11)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse17) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse13 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse15 4)) (not (= .cse14 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse26 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse21 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse25 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse26 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse24 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse25 .cse26 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse22 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse20 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse25 .cse26 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse22)))) (or (not (= .cse20 4)) (not (= 4 .cse21)) (< (+ 3 .cse22) (+ .cse23 .cse20 .cse24 .cse25 .cse26 .cse21)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse23 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse27) (not (= .cse25 4)) (not (= .cse24 4))))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse30 4) (= .cse31 (+ .cse30 8)) (= (select .cse32 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (<= |c_ULTIMATE.start_main_~i~0#1| 3) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse37 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse38 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse36 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse37 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse35 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse36 .cse37 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse34 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse35 .cse36 .cse37 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (< (+ .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (+ .cse7 21)) (not (= .cse34 4)) (not (= 4 .cse38)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse17) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse33 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse36 4)) (not (= .cse35 4))))))))))) (= (+ .cse30 4 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse31) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse46 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse42 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse45 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse46 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse44 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse45 .cse46 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse41 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44 .cse45 .cse46 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (not (= .cse41 4)) (not (= 4 .cse42)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse43 4)) (< (+ .cse43 .cse41 .cse44 .cse45 .cse46 .cse42) (+ .cse7 17)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse27) (not (= .cse45 4)) (not (= .cse44 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse57 (select .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse55 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse50 (select (select (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse54 (select (select (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse55 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse53 (select (select (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse54 .cse55 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse51 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse49 (select (select (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse54 .cse55 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse51)))) (or (not (= .cse49 4)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse1) (not (= 4 .cse50)) (< (+ 3 .cse51) (+ .cse52 .cse49 .cse53 .cse54 .cse55 .cse50)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse52 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse54 4)) (not (= .cse53 4)))))))))))))) is different from false [2022-12-13 20:45:42,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:45:47,311 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse20 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse40 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse17 (+ |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse36 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (<= 5 c_~N~0) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (not (= .cse0 4)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse1) (not (= 4 .cse2)) (< (+ .cse3 .cse0 .cse4 .cse5 .cse6 .cse2) (+ .cse7 13)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse3 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse5 4)) (not (= .cse4 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse15 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse14 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse15 .cse16 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse12 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse10 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse15 .cse16 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse12)))) (or (not (= .cse10 4)) (not (= 4 .cse11)) (< (+ 3 .cse12) (+ .cse13 .cse10 .cse14 .cse15 .cse16 .cse11)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse17) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse13 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse15 4)) (not (= .cse14 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse21 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse25 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse26 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse24 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse23 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse24 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse22 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse23 .cse24 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (< |v_ULTIMATE.start_main_~i~0#1_200| .cse20) (< (+ .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (+ .cse7 9)) (not (= .cse22 4)) (not (= 4 .cse26)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse21 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse24 4)) (not (= .cse23 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse35 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse30 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse34 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse35 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse33 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse34 .cse35 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse31 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse29 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse31)))) (or (not (= .cse29 4)) (not (= 4 .cse30)) (< (+ 3 .cse31) (+ .cse32 .cse29 .cse33 .cse34 .cse35 .cse30)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse32 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse36) (not (= .cse34 4)) (not (= .cse33 4))))))))))) (exists ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (|v_ULTIMATE.start_main_~i~0#1_197| Int)) (let ((.cse39 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse39 |ULTIMATE.start_main_~a~0#1.offset|) 4) (= (select .cse39 (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (= (select .cse39 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 4) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1)) (= .cse40 (+ 16 (select .cse39 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_198| 4))))) (<= |v_ULTIMATE.start_main_~i~0#1_198| (+ |v_ULTIMATE.start_main_~i~0#1_197| 1)) (= (select .cse39 (+ (* |v_ULTIMATE.start_main_~i~0#1_197| 4) |ULTIMATE.start_main_~a~0#1.offset|)) 4) (<= |v_ULTIMATE.start_main_~i~0#1_197| 3) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse47 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse42 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse46 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse47 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse45 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse46 .cse47 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse43 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse41 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45 .cse46 .cse47 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse43)))) (or (< |v_ULTIMATE.start_main_~i~0#1_200| .cse20) (not (= .cse41 4)) (not (= 4 .cse42)) (< (+ 3 .cse43) (+ .cse44 .cse41 .cse45 .cse46 .cse47 .cse42)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse44 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse46 4)) (not (= .cse45 4))))))))))) (= .cse40 20) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse53 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse51 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse55 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse56 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse54 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse55 .cse56 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse52 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse50 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse54 .cse55 .cse56 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse52)))) (or (not (= .cse50 4)) (not (= 4 .cse51)) (< (+ 3 .cse52) (+ .cse53 .cse50 .cse54 .cse55 .cse56 .cse51)) (< |v_ULTIMATE.start_main_~i~0#1_200| |c_ULTIMATE.start_main_~i~0#1|) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse53 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse55 4)) (not (= .cse54 4))))))))))) (exists ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (|v_ULTIMATE.start_main_~i~0#1_197| Int)) (let ((.cse59 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse59 |ULTIMATE.start_main_~a~0#1.offset|) 4) (= (select .cse59 (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (= (select .cse59 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 4) (= .cse40 (+ 16 (select .cse59 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_198| 4))))) (<= |v_ULTIMATE.start_main_~i~0#1_198| (+ |v_ULTIMATE.start_main_~i~0#1_197| 1)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_198| 1)) (= (select .cse59 (+ (* |v_ULTIMATE.start_main_~i~0#1_197| 4) |ULTIMATE.start_main_~a~0#1.offset|)) 4) (<= |v_ULTIMATE.start_main_~i~0#1_197| 3) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse67 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse62 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse65 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse61 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse64 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse65 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse63 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse64 .cse65 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse60 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse63 .cse64 .cse65 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (not (= .cse60 4)) (not (= 4 .cse61)) (< |v_ULTIMATE.start_main_~i~0#1_200| |c_ULTIMATE.start_main_~i~0#1|) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse62 4)) (< (+ .cse62 .cse60 .cse63 .cse64 .cse65 .cse61) (+ 5 .cse7)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse64 4)) (not (= .cse63 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse72 (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse73 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse71 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse72 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse70 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse71 .cse72 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse69 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse70 .cse71 .cse72 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (< (+ .cse68 .cse69 .cse70 .cse71 .cse72 .cse73) (+ .cse7 21)) (not (= .cse69 4)) (not (= 4 .cse73)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse17) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse68 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse71 4)) (not (= .cse70 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse82 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse83 (select .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse78 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse81 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse80 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse81 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse79 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse80 .cse81 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse76 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse79 .cse80 .cse81 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (not (= .cse76 4)) (not (= 4 .cse77)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse78 4)) (< (+ .cse78 .cse76 .cse79 .cse80 .cse81 .cse77) (+ .cse7 17)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse36) (not (= .cse80 4)) (not (= .cse79 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse91 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse92 (select .cse91 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse87 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse90 (select .cse92 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse85 (select (select (store .cse91 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse90))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse89 (select (select (store .cse91 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse90 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse88 (select (select (store .cse91 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse89 .cse90 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse86 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse84 (select (select (store .cse91 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse88 .cse89 .cse90 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse86)))) (or (not (= .cse84 4)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse1) (not (= 4 .cse85)) (< (+ 3 .cse86) (+ .cse87 .cse84 .cse88 .cse89 .cse90 .cse85)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse87 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse89 4)) (not (= .cse88 4))))))))))))) is different from false [2022-12-13 20:45:49,332 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse20 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse40 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse17 (+ |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse36 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (<= 5 c_~N~0) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (not (= .cse0 4)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse1) (not (= 4 .cse2)) (< (+ .cse3 .cse0 .cse4 .cse5 .cse6 .cse2) (+ .cse7 13)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse3 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse5 4)) (not (= .cse4 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse15 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse16 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse14 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse15 .cse16 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse12 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse10 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse15 .cse16 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse12)))) (or (not (= .cse10 4)) (not (= 4 .cse11)) (< (+ 3 .cse12) (+ .cse13 .cse10 .cse14 .cse15 .cse16 .cse11)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse17) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse13 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse15 4)) (not (= .cse14 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse21 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse25 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse26 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse24 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse23 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse24 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse22 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse23 .cse24 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (< |v_ULTIMATE.start_main_~i~0#1_200| .cse20) (< (+ .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (+ .cse7 9)) (not (= .cse22 4)) (not (= 4 .cse26)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse21 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse24 4)) (not (= .cse23 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse32 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse35 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse30 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse34 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse35 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse33 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse34 .cse35 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse31 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse29 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33 .cse34 .cse35 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse31)))) (or (not (= .cse29 4)) (not (= 4 .cse30)) (< (+ 3 .cse31) (+ .cse32 .cse29 .cse33 .cse34 .cse35 .cse30)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse32 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse36) (not (= .cse34 4)) (not (= .cse33 4))))))))))) (exists ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (|v_ULTIMATE.start_main_~i~0#1_197| Int)) (let ((.cse39 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse39 |ULTIMATE.start_main_~a~0#1.offset|) 4) (= (select .cse39 (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (= (select .cse39 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 4) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1)) (= .cse40 (+ 16 (select .cse39 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_198| 4))))) (<= |v_ULTIMATE.start_main_~i~0#1_198| (+ |v_ULTIMATE.start_main_~i~0#1_197| 1)) (= (select .cse39 (+ (* |v_ULTIMATE.start_main_~i~0#1_197| 4) |ULTIMATE.start_main_~a~0#1.offset|)) 4) (<= |v_ULTIMATE.start_main_~i~0#1_197| 3) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse47 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse42 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse46 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse47 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse45 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse46 .cse47 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse43 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse41 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45 .cse46 .cse47 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse43)))) (or (< |v_ULTIMATE.start_main_~i~0#1_200| .cse20) (not (= .cse41 4)) (not (= 4 .cse42)) (< (+ 3 .cse43) (+ .cse44 .cse41 .cse45 .cse46 .cse47 .cse42)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse44 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse46 4)) (not (= .cse45 4))))))))))) (= .cse40 20) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse58 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse53 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse51 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse55 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse56 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse54 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse55 .cse56 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse52 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse50 (select (select (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse54 .cse55 .cse56 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse52)))) (or (not (= .cse50 4)) (not (= 4 .cse51)) (< (+ 3 .cse52) (+ .cse53 .cse50 .cse54 .cse55 .cse56 .cse51)) (< |v_ULTIMATE.start_main_~i~0#1_200| |c_ULTIMATE.start_main_~i~0#1|) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse53 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse55 4)) (not (= .cse54 4))))))))))) (exists ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (|v_ULTIMATE.start_main_~i~0#1_197| Int)) (let ((.cse59 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse59 |ULTIMATE.start_main_~a~0#1.offset|) 4) (= (select .cse59 (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (= (select .cse59 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 4) (= .cse40 (+ 16 (select .cse59 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_198| 4))))) (<= |v_ULTIMATE.start_main_~i~0#1_198| (+ |v_ULTIMATE.start_main_~i~0#1_197| 1)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_198| 1)) (= (select .cse59 (+ (* |v_ULTIMATE.start_main_~i~0#1_197| 4) |ULTIMATE.start_main_~a~0#1.offset|)) 4) (<= |v_ULTIMATE.start_main_~i~0#1_197| 3) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse67 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse62 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse65 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse61 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse64 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse65 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse63 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse64 .cse65 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse60 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse63 .cse64 .cse65 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (not (= .cse60 4)) (not (= 4 .cse61)) (< |v_ULTIMATE.start_main_~i~0#1_200| |c_ULTIMATE.start_main_~i~0#1|) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse62 4)) (< (+ .cse62 .cse60 .cse63 .cse64 .cse65 .cse61) (+ 5 .cse7)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse64 4)) (not (= .cse63 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse72 (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse73 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse71 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse72 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse70 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse71 .cse72 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse69 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse70 .cse71 .cse72 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (< (+ .cse68 .cse69 .cse70 .cse71 .cse72 .cse73) (+ .cse7 21)) (not (= .cse69 4)) (not (= 4 .cse73)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse17) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse68 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse71 4)) (not (= .cse70 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse82 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse83 (select .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse78 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse81 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse80 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse81 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse79 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse80 .cse81 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse76 (select (select (store .cse82 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse78 .cse79 .cse80 .cse81 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_200| 4))))) (or (not (= .cse76 4)) (not (= 4 .cse77)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse78 4)) (< (+ .cse78 .cse76 .cse79 .cse80 .cse81 .cse77) (+ .cse7 17)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse36) (not (= .cse80 4)) (not (= .cse79 4))))))))))) (forall ((v_ArrVal_667 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_201| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_200| Int)) (let ((.cse91 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_667))) (let ((.cse92 (select .cse91 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse87 (select v_ArrVal_667 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse90 (select .cse92 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse85 (select (select (store .cse91 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse90))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse89 (select (select (store .cse91 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse90 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse88 (select (select (store .cse91 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse89 .cse90 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_201| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse86 (* |v_ULTIMATE.start_main_~i~0#1_200| 4))) (let ((.cse84 (select (select (store .cse91 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse88 .cse89 .cse90 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse86)))) (or (not (= .cse84 4)) (< |v_ULTIMATE.start_main_~i~0#1_200| .cse1) (not (= 4 .cse85)) (< (+ 3 .cse86) (+ .cse87 .cse84 .cse88 .cse89 .cse90 .cse85)) (not (<= |v_ULTIMATE.start_main_~i~0#1_201| 3)) (not (= .cse87 4)) (not (<= |v_ULTIMATE.start_main_~i~0#1_200| (+ |v_ULTIMATE.start_main_~i~0#1_201| 1))) (not (= .cse89 4)) (not (= .cse88 4))))))))))))) is different from true [2022-12-13 20:45:51,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:45:53,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:45:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:45:56,446 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2022-12-13 20:45:56,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-13 20:45:56,447 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 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 36 [2022-12-13 20:45:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:45:56,447 INFO L225 Difference]: With dead ends: 81 [2022-12-13 20:45:56,447 INFO L226 Difference]: Without dead ends: 77 [2022-12-13 20:45:56,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2507 ImplicationChecksByTransitivity, 161.6s TimeCoverageRelationStatistics Valid=917, Invalid=9198, Unknown=199, NotChecked=606, Total=10920 [2022-12-13 20:45:56,449 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 103 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 34.9s IncrementalHoareTripleChecker+Time [2022-12-13 20:45:56,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 120 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1237 Invalid, 28 Unknown, 3 Unchecked, 34.9s Time] [2022-12-13 20:45:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-13 20:45:56,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 40. [2022-12-13 20:45:56,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 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-12-13 20:45:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-12-13 20:45:56,468 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 36 [2022-12-13 20:45:56,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:45:56,468 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-12-13 20:45:56,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 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-12-13 20:45:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-12-13 20:45:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 20:45:56,469 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:45:56,469 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:45:56,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 20:45:56,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 20:45:56,671 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:45:56,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:45:56,672 INFO L85 PathProgramCache]: Analyzing trace with hash -338157539, now seen corresponding path program 5 times [2022-12-13 20:45:56,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:45:56,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916070696] [2022-12-13 20:45:56,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:45:56,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:45:56,710 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 20:45:56,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596626596] [2022-12-13 20:45:56,711 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 20:45:56,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:45:56,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:45:56,713 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:45:56,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 20:45:56,825 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-12-13 20:45:56,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:45:56,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 20:45:56,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:45:56,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 20:45:56,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 20:45:57,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-13 20:45:57,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:45:57,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-13 20:45:57,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 20:45:57,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 20:45:57,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 20:45:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 20:45:57,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:46:18,171 INFO L321 Elim1Store]: treesize reduction 63, result has 37.6 percent of original size [2022-12-13 20:46:18,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50 [2022-12-13 20:46:18,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:46:18,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-12-13 20:46:18,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:46:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 20:46:18,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:46:18,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916070696] [2022-12-13 20:46:18,514 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 20:46:18,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596626596] [2022-12-13 20:46:18,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596626596] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:46:18,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:46:18,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2022-12-13 20:46:18,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769732646] [2022-12-13 20:46:18,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:46:18,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 20:46:18,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:46:18,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 20:46:18,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=530, Unknown=24, NotChecked=0, Total=650 [2022-12-13 20:46:18,515 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 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-12-13 20:46:19,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:46:19,810 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-12-13 20:46:19,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 20:46:19,811 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 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 36 [2022-12-13 20:46:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:46:19,811 INFO L225 Difference]: With dead ends: 53 [2022-12-13 20:46:19,811 INFO L226 Difference]: Without dead ends: 41 [2022-12-13 20:46:19,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=138, Invalid=768, Unknown=24, NotChecked=0, Total=930 [2022-12-13 20:46:19,812 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 20:46:19,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 61 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 20:46:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-12-13 20:46:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-12-13 20:46:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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-12-13 20:46:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-12-13 20:46:19,837 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 36 [2022-12-13 20:46:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:46:19,837 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-12-13 20:46:19,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 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-12-13 20:46:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-12-13 20:46:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 20:46:19,838 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:46:19,838 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:46:19,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 20:46:20,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:46:20,040 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:46:20,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:46:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash 465948487, now seen corresponding path program 12 times [2022-12-13 20:46:20,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:46:20,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806441007] [2022-12-13 20:46:20,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:46:20,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:46:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:46:20,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:46:20,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806441007] [2022-12-13 20:46:20,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806441007] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:46:20,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925896839] [2022-12-13 20:46:20,521 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 20:46:20,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:46:20,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:46:20,522 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:46:20,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 20:46:20,645 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-12-13 20:46:20,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:46:20,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 20:46:20,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:46:21,235 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:46:21,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:46:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:46:21,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925896839] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:46:21,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:46:21,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2022-12-13 20:46:21,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704630711] [2022-12-13 20:46:21,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:46:21,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 20:46:21,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:46:21,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 20:46:21,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-12-13 20:46:21,707 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 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-12-13 20:46:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:46:22,610 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-12-13 20:46:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 20:46:22,611 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 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 39 [2022-12-13 20:46:22,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:46:22,611 INFO L225 Difference]: With dead ends: 86 [2022-12-13 20:46:22,611 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 20:46:22,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2022-12-13 20:46:22,612 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 20:46:22,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 39 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 20:46:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 20:46:22,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2022-12-13 20:46:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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-12-13 20:46:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-12-13 20:46:22,628 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 39 [2022-12-13 20:46:22,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:46:22,629 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-12-13 20:46:22,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 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-12-13 20:46:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-12-13 20:46:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 20:46:22,629 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:46:22,629 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:46:22,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 20:46:22,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:46:22,830 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:46:22,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:46:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash -552579063, now seen corresponding path program 13 times [2022-12-13 20:46:22,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:46:22,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650131374] [2022-12-13 20:46:22,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:46:22,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:46:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:46:26,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:46:26,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650131374] [2022-12-13 20:46:26,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650131374] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:46:26,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604472175] [2022-12-13 20:46:26,642 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 20:46:26,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:46:26,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:46:26,643 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:46:26,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 20:46:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:26,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 87 conjunts are in the unsatisfiable core [2022-12-13 20:46:26,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:46:26,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:46:26,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 20:46:26,799 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 14 treesize of output 16 [2022-12-13 20:46:26,845 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 14 treesize of output 16 [2022-12-13 20:46:26,900 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 14 treesize of output 16 [2022-12-13 20:46:26,946 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 14 treesize of output 16 [2022-12-13 20:46:26,987 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 14 treesize of output 16 [2022-12-13 20:46:27,039 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 14 treesize of output 16 [2022-12-13 20:46:27,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 20:46:28,288 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:46:28,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-12-13 20:46:28,814 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:46:28,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-12-13 20:46:29,339 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:46:29,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-12-13 20:46:29,887 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:46:29,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-12-13 20:46:30,429 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:46:30,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-12-13 20:46:30,790 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:46:30,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2022-12-13 20:46:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:46:30,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:47:51,847 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (v_subst_12 Int) (v_subst_9 Int) (v_subst_8 Int) (v_subst_16 Int) (|v_ULTIMATE.start_main_~i~0#1_270| Int) (v_ArrVal_871 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_871))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_871 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_270| 4)))) (.cse3 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse6) (+ 5 .cse7)) (not (= 4 .cse6)) (not (= 4 .cse5)) (not (= .cse2 4)) (not (= .cse4 4)))))))))))) (forall ((v_subst_15 Int) (v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_7 Int) (|v_ULTIMATE.start_main_~i~0#1_271| Int) (v_subst_11 Int) (v_ArrVal_871 (Array Int Int)) (v_subst_10 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_871))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select v_ArrVal_871 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_271| 4))))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (< (+ .cse7 3) (+ .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) (not (= .cse11 4)) (not (= .cse13 4)) (not (= .cse14 4)) (not (= .cse16 4)) (not (= .cse15 4)) (not (= .cse12 4)))))))))))))) is different from false [2022-12-13 20:47:52,554 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (v_subst_12 Int) (v_subst_9 Int) (v_subst_8 Int) (v_subst_16 Int) (|v_ULTIMATE.start_main_~i~0#1_270| Int) (v_ArrVal_871 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_871))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select v_ArrVal_871 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_270| 4)))) (.cse5 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse0 .cse6 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5 .cse0 .cse6 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (not (= 4 .cse2)) (not (= 4 .cse3)) (< (+ .cse1 .cse4 .cse5 .cse0 .cse6 .cse3 .cse2) (+ .cse7 9)) (not (= .cse4 4)) (not (= .cse6 4)))))))))))) (forall ((v_subst_15 Int) (v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_7 Int) (|v_ULTIMATE.start_main_~i~0#1_271| Int) (v_subst_11 Int) (v_ArrVal_871 (Array Int Int)) (v_subst_10 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_871))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select v_ArrVal_871 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_271| 4))))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse10 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse12 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= .cse10 4)) (< (+ 7 .cse7) (+ .cse11 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16)) (not (= .cse13 4)) (not (= .cse14 4)) (not (= .cse16 4)) (not (= .cse15 4)) (not (= .cse12 4)))))))))))))) is different from false [2022-12-13 20:47:53,602 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_15 Int) (v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_7 Int) (|v_ULTIMATE.start_main_~i~0#1_271| Int) (v_subst_11 Int) (v_ArrVal_871 (Array Int Int)) (v_subst_10 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_871))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_871 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_271| 4))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse5 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse0 .cse5 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse0 .cse5 .cse1 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (not (= .cse2 4)) (not (= .cse3 4)) (not (= .cse4 4)) (not (= .cse5 4)) (< (+ .cse6 11) (+ .cse7 .cse0 .cse5 .cse1 .cse2 .cse4 .cse3)))))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (v_subst_12 Int) (v_subst_9 Int) (v_subst_8 Int) (v_subst_16 Int) (|v_ULTIMATE.start_main_~i~0#1_270| Int) (v_ArrVal_871 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_871))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select v_ArrVal_871 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_270| 4)))) (.cse13 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse10 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse10 4)) (< (+ .cse11 .cse12 .cse13 .cse10 .cse14 .cse15 .cse16) (+ .cse6 13)) (not (= .cse11 4)) (not (= 4 .cse16)) (not (= 4 .cse15)) (not (= .cse12 4)) (not (= .cse14 4)))))))))))))) is different from false [2022-12-13 20:47:54,732 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_15 Int) (v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_7 Int) (|v_ULTIMATE.start_main_~i~0#1_271| Int) (v_subst_11 Int) (v_ArrVal_871 (Array Int Int)) (v_subst_10 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_871))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_871 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_271| 4))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse0 .cse6 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse0 .cse6 .cse1 .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (not (= .cse2 4)) (not (= .cse3 4)) (< (+ .cse4 15) (+ .cse5 .cse0 .cse6 .cse1 .cse2 .cse7 .cse3)) (not (= .cse7 4)) (not (= .cse6 4)))))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (v_subst_12 Int) (v_subst_9 Int) (v_subst_8 Int) (v_subst_16 Int) (|v_ULTIMATE.start_main_~i~0#1_270| Int) (v_ArrVal_871 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_871))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select v_ArrVal_871 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_270| 4)))) (.cse15 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse10 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse16 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse10 .cse16 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse12 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse14 .cse15 .cse10 .cse16 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse10 4)) (not (= .cse11 4)) (not (= 4 .cse12)) (not (= 4 .cse13)) (not (= .cse14 4)) (< (+ .cse11 .cse14 .cse15 .cse10 .cse16 .cse13 .cse12) (+ .cse4 17)) (not (= .cse16 4)))))))))))))) is different from false [2022-12-13 20:47:55,790 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_15 Int) (v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_7 Int) (|v_ULTIMATE.start_main_~i~0#1_271| Int) (v_subst_11 Int) (v_ArrVal_871 (Array Int Int)) (v_subst_10 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_871))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_871 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_271| 4))))) (let ((.cse1 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse2 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse0 .cse6 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse3 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse0 .cse6 .cse1 .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (not (= .cse2 4)) (not (= .cse3 4)) (< (+ 19 .cse4) (+ .cse5 .cse0 .cse6 .cse1 .cse2 .cse7 .cse3)) (not (= .cse7 4)) (not (= .cse6 4)))))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (v_subst_12 Int) (v_subst_9 Int) (v_subst_8 Int) (v_subst_16 Int) (|v_ULTIMATE.start_main_~i~0#1_270| Int) (v_ArrVal_871 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_871))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select v_ArrVal_871 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_270| 4)))) (.cse12 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse13 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse10 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (< (+ .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (+ .cse4 21)) (not (= .cse13 4)) (not (= .cse10 4)) (not (= 4 .cse16)) (not (= 4 .cse15)) (not (= .cse11 4)) (not (= .cse14 4)))))))))))))) is different from false [2022-12-13 20:47:56,933 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_subst_15 Int) (v_subst_14 Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_7 Int) (|v_ULTIMATE.start_main_~i~0#1_271| Int) (v_subst_11 Int) (v_ArrVal_871 (Array Int Int)) (v_subst_10 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_871))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_ArrVal_871 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_271| 4))))) (let ((.cse4 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_15 4))))) (let ((.cse5 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_14 4))))) (let ((.cse0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse6 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0 .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= .cse0 4)) (< (+ 23 .cse1) (+ .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7)) (not (= .cse4 4)) (not (= .cse5 4)) (not (= .cse7 4)) (not (= .cse6 4)) (not (= .cse3 4)))))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_13 Int) (v_subst_12 Int) (v_subst_9 Int) (v_subst_8 Int) (v_subst_16 Int) (|v_ULTIMATE.start_main_~i~0#1_270| Int) (v_ArrVal_871 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_871))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select v_ArrVal_871 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_270| 4)))) (.cse13 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_16 4))))) (let ((.cse14 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* v_subst_13 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse10 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse11 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse10 .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse10 4)) (not (= .cse11 4)) (< (+ .cse11 .cse12 .cse13 .cse10 .cse14 .cse15 .cse16) (+ .cse1 25)) (not (= 4 .cse16)) (not (= 4 .cse15)) (not (= .cse12 4)) (not (= .cse14 4)))))))))))))) is different from false [2022-12-13 20:47:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2022-12-13 20:47:57,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604472175] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:47:57,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:47:57,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 24] total 66 [2022-12-13 20:47:57,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316591623] [2022-12-13 20:47:57,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:47:57,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-12-13 20:47:57,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:47:57,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-12-13 20:47:57,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3304, Unknown=29, NotChecked=726, Total=4290 [2022-12-13 20:47:57,450 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 66 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 66 states have internal predecessors, (98), 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-12-13 20:48:22,480 WARN L233 SmtUtils]: Spent 17.18s on a formula simplification. DAG size of input: 248 DAG size of output: 201 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:48:35,131 WARN L233 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 250 DAG size of output: 141 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:48:37,424 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-12-13 20:48:40,297 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-12-13 20:49:12,356 WARN L233 SmtUtils]: Spent 25.14s on a formula simplification. DAG size of input: 250 DAG size of output: 248 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:49:47,410 WARN L233 SmtUtils]: Spent 21.42s on a formula simplification. DAG size of input: 250 DAG size of output: 202 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:49:49,908 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-12-13 20:50:28,458 WARN L233 SmtUtils]: Spent 28.83s on a formula simplification. DAG size of input: 249 DAG size of output: 247 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:50:39,954 WARN L233 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 163 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:50:42,426 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-12-13 20:50:44,435 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-12-13 20:50:52,810 WARN L233 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 154 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:50:54,865 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-12-13 20:50:56,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:50:58,966 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-12-13 20:51:07,720 WARN L233 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 156 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:51:10,094 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-12-13 20:51:18,825 WARN L233 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 160 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:51:21,146 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-12-13 20:51:23,152 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-12-13 20:51:25,159 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-12-13 20:51:28,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-12-13 20:51:38,088 WARN L233 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 155 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:51:40,520 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-12-13 20:51:43,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-12-13 20:51:52,266 WARN L233 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 157 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:51:54,581 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-12-13 20:51:57,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-12-13 20:52:03,786 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-12-13 20:52:06,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-12-13 20:52:07,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:52:07,144 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2022-12-13 20:52:07,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 20:52:07,145 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 66 states have internal predecessors, (98), 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 41 [2022-12-13 20:52:07,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:52:07,145 INFO L225 Difference]: With dead ends: 71 [2022-12-13 20:52:07,145 INFO L226 Difference]: Without dead ends: 67 [2022-12-13 20:52:07,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 49 SyntacticMatches, 8 SemanticMatches, 85 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1688 ImplicationChecksByTransitivity, 271.4s TimeCoverageRelationStatistics Valid=411, Invalid=6058, Unknown=35, NotChecked=978, Total=7482 [2022-12-13 20:52:07,149 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 37 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 63.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:52:07,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 159 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1347 Invalid, 41 Unknown, 288 Unchecked, 63.0s Time] [2022-12-13 20:52:07,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-13 20:52:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2022-12-13 20:52:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 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-12-13 20:52:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-12-13 20:52:07,175 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 41 [2022-12-13 20:52:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:52:07,175 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-12-13 20:52:07,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 66 states have internal predecessors, (98), 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-12-13 20:52:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-12-13 20:52:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 20:52:07,175 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:52:07,176 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:52:07,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 20:52:07,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:52:07,377 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:52:07,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:52:07,378 INFO L85 PathProgramCache]: Analyzing trace with hash -294413625, now seen corresponding path program 6 times [2022-12-13 20:52:07,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:52:07,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606330627] [2022-12-13 20:52:07,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:52:07,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:52:07,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 20:52:07,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299227261] [2022-12-13 20:52:07,404 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 20:52:07,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:52:07,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:52:07,405 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:52:07,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 20:52:07,527 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-12-13 20:52:07,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:52:07,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 20:52:07,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:52:07,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-13 20:52:07,982 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 28 treesize of output 27 [2022-12-13 20:52:08,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:52:08,288 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 1 case distinctions, treesize of input 32 treesize of output 34 [2022-12-13 20:52:08,590 INFO L321 Elim1Store]: treesize reduction 66, result has 29.8 percent of original size [2022-12-13 20:52:08,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 48 [2022-12-13 20:52:09,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:52:09,553 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 32 [2022-12-13 20:52:09,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:52:09,868 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 32 [2022-12-13 20:52:10,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:52:10,195 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 32 [2022-12-13 20:52:10,700 INFO L321 Elim1Store]: treesize reduction 10, result has 67.7 percent of original size [2022-12-13 20:52:10,700 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 39 treesize of output 33 [2022-12-13 20:52:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:52:11,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:52:56,764 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_956 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_292| Int)) (or (not (< (+ 3 |v_ULTIMATE.start_main_~i~0#1_292|) c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_292| 4) c_~N~0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 4)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_956) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_292| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (< 2 |v_ULTIMATE.start_main_~i~0#1_292|))) is different from false [2022-12-13 20:53:25,090 INFO L321 Elim1Store]: treesize reduction 97, result has 34.5 percent of original size [2022-12-13 20:53:25,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2022-12-13 20:53:25,321 INFO L321 Elim1Store]: treesize reduction 40, result has 57.9 percent of original size [2022-12-13 20:53:25,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 93 [2022-12-13 20:53:25,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2022-12-13 20:53:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 69 refuted. 1 times theorem prover too weak. 0 trivial. 11 not checked. [2022-12-13 20:53:28,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:53:28,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606330627] [2022-12-13 20:53:28,708 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 20:53:28,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299227261] [2022-12-13 20:53:28,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299227261] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:53:28,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:53:28,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2022-12-13 20:53:28,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792236873] [2022-12-13 20:53:28,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:53:28,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-13 20:53:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:53:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-13 20:53:28,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1205, Unknown=49, NotChecked=74, Total=1560 [2022-12-13 20:53:28,709 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 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-12-13 20:54:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:54:09,579 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2022-12-13 20:54:09,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 20:54:09,580 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 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 41 [2022-12-13 20:54:09,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:54:09,581 INFO L225 Difference]: With dead ends: 91 [2022-12-13 20:54:09,581 INFO L226 Difference]: Without dead ends: 79 [2022-12-13 20:54:09,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 112.3s TimeCoverageRelationStatistics Valid=637, Invalid=3224, Unknown=49, NotChecked=122, Total=4032 [2022-12-13 20:54:09,582 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 90 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-12-13 20:54:09,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 53 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 585 Invalid, 0 Unknown, 37 Unchecked, 6.4s Time] [2022-12-13 20:54:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-13 20:54:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2022-12-13 20:54:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.125) internal successors, (72), 64 states have internal predecessors, (72), 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-12-13 20:54:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-12-13 20:54:09,620 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 41 [2022-12-13 20:54:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:54:09,620 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-12-13 20:54:09,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 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-12-13 20:54:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-12-13 20:54:09,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 20:54:09,620 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:54:09,620 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:54:09,625 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 20:54:09,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:54:09,822 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:54:09,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:09,823 INFO L85 PathProgramCache]: Analyzing trace with hash -105011125, now seen corresponding path program 14 times [2022-12-13 20:54:09,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:54:09,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199884729] [2022-12-13 20:54:09,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:54:09,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:54:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:54:10,845 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:10,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:54:10,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199884729] [2022-12-13 20:54:10,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199884729] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:54:10,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416857687] [2022-12-13 20:54:10,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:54:10,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:54:10,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:54:10,847 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:54:10,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 20:54:10,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:54:10,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:54:10,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 20:54:10,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:54:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:12,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:54:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:13,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416857687] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:54:13,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:54:13,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2022-12-13 20:54:13,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549218393] [2022-12-13 20:54:13,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:54:13,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 20:54:13,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:54:13,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 20:54:13,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2022-12-13 20:54:13,200 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 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-12-13 20:54:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:54:16,336 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2022-12-13 20:54:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 20:54:16,337 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 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 43 [2022-12-13 20:54:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:54:16,338 INFO L225 Difference]: With dead ends: 91 [2022-12-13 20:54:16,338 INFO L226 Difference]: Without dead ends: 87 [2022-12-13 20:54:16,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 14 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 20:54:16,340 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:54:16,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 28 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-12-13 20:54:16,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-12-13 20:54:16,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 48. [2022-12-13 20:54:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 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-12-13 20:54:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-12-13 20:54:16,390 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 43 [2022-12-13 20:54:16,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:54:16,390 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-12-13 20:54:16,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 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-12-13 20:54:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-12-13 20:54:16,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 20:54:16,391 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:54:16,391 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:54:16,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 20:54:16,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:54:16,592 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:54:16,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2029167523, now seen corresponding path program 15 times [2022-12-13 20:54:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:54:16,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129253111] [2022-12-13 20:54:16,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:54:16,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:54:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:54:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 54 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:17,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:54:17,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129253111] [2022-12-13 20:54:17,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129253111] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:54:17,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603597961] [2022-12-13 20:54:17,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:54:17,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:54:17,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:54:17,550 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:54:17,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 20:54:17,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-12-13 20:54:17,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:54:17,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 20:54:17,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:54:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:18,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:54:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:19,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603597961] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:54:19,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:54:19,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2022-12-13 20:54:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954502765] [2022-12-13 20:54:19,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:54:19,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 20:54:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:54:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 20:54:19,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2022-12-13 20:54:19,956 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 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-12-13 20:54:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:54:21,467 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-12-13 20:54:21,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 20:54:21,468 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 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 44 [2022-12-13 20:54:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:54:21,468 INFO L225 Difference]: With dead ends: 100 [2022-12-13 20:54:21,468 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 20:54:21,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 65 SyntacticMatches, 14 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=270, Invalid=786, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 20:54:21,469 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 71 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 20:54:21,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 33 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 20:54:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 20:54:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2022-12-13 20:54:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 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-12-13 20:54:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-12-13 20:54:21,502 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 44 [2022-12-13 20:54:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:54:21,502 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-12-13 20:54:21,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 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-12-13 20:54:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-12-13 20:54:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 20:54:21,502 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:54:21,502 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:54:21,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 20:54:21,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 20:54:21,704 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:54:21,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:21,705 INFO L85 PathProgramCache]: Analyzing trace with hash -111213349, now seen corresponding path program 16 times [2022-12-13 20:54:21,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:54:21,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691110350] [2022-12-13 20:54:21,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:54:21,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:54:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:54:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:28,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:54:28,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691110350] [2022-12-13 20:54:28,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691110350] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:54:28,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249294221] [2022-12-13 20:54:28,997 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 20:54:28,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:54:28,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:54:28,998 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:54:29,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f71e45d-e455-42f3-90d5-7b66a7f3e75b/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 20:54:29,117 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 20:54:29,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:54:29,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 105 conjunts are in the unsatisfiable core [2022-12-13 20:54:29,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:54:29,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:54:29,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 20:54:29,399 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 14 treesize of output 16 [2022-12-13 20:54:29,677 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 14 treesize of output 16 [2022-12-13 20:54:29,989 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 14 treesize of output 16 [2022-12-13 20:54:30,302 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 14 treesize of output 16 [2022-12-13 20:54:30,653 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 14 treesize of output 16 [2022-12-13 20:54:31,013 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 14 treesize of output 16 [2022-12-13 20:54:31,365 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 14 treesize of output 16 [2022-12-13 20:54:33,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-12-13 20:54:34,366 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 20:54:34,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 41 [2022-12-13 20:54:35,838 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-12-13 20:54:35,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 57 [2022-12-13 20:54:37,631 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 20:54:37,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 71 [2022-12-13 20:54:39,464 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-12-13 20:54:39,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 83 [2022-12-13 20:54:41,485 INFO L321 Elim1Store]: treesize reduction 180, result has 0.6 percent of original size [2022-12-13 20:54:41,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 109 treesize of output 99 [2022-12-13 20:54:44,653 INFO L321 Elim1Store]: treesize reduction 252, result has 0.4 percent of original size [2022-12-13 20:54:44,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 135 treesize of output 116 [2022-12-13 20:54:45,975 INFO L321 Elim1Store]: treesize reduction 252, result has 0.4 percent of original size [2022-12-13 20:54:45,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 156 treesize of output 52 [2022-12-13 20:54:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:54:46,445 INFO L328 TraceCheckSpWp]: Computing backward predicates...