./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/sina3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/sina3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro --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 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a --- 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-8393723 [2022-11-18 20:30:46,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:30:46,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:30:46,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:30:46,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:30:46,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:30:46,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:30:46,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:30:46,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:30:46,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:30:46,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:30:46,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:30:46,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:30:46,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:30:46,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:30:46,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:30:46,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:30:46,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:30:46,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:30:46,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:30:46,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:30:46,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:30:46,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:30:46,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:30:46,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:30:46,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:30:46,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:30:46,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:30:46,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:30:46,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:30:46,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:30:46,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:30:46,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:30:46,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:30:46,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:30:46,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:30:46,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:30:46,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:30:46,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:30:46,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:30:46,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:30:46,761 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:30:46,792 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:30:46,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:30:46,793 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:30:46,793 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:30:46,794 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:30:46,794 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:30:46,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:30:46,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:30:46,795 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:30:46,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:30:46,795 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:30:46,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:30:46,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:30:46,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:30:46,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:30:46,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:30:46,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:30:46,796 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:30:46,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:30:46,797 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:30:46,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:30:46,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:30:46,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:30:46,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:30:46,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:30:46,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:30:46,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:30:46,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:30:46,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:30:46,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:30:46,800 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:30:46,801 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:30:46,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:30:46,801 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/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_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro 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 -> 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a [2022-11-18 20:30:47,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:30:47,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:30:47,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:30:47,119 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:30:47,120 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:30:47,121 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/array-fpi/sina3.c [2022-11-18 20:30:47,201 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/data/27cc86275/636e972ab7b544c889a6f148447adc19/FLAGa327790d5 [2022-11-18 20:30:47,660 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:30:47,661 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/sv-benchmarks/c/array-fpi/sina3.c [2022-11-18 20:30:47,667 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/data/27cc86275/636e972ab7b544c889a6f148447adc19/FLAGa327790d5 [2022-11-18 20:30:48,061 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/data/27cc86275/636e972ab7b544c889a6f148447adc19 [2022-11-18 20:30:48,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:30:48,065 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:30:48,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:30:48,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:30:48,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:30:48,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1615bd83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48, skipping insertion in model container [2022-11-18 20:30:48,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:30:48,093 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:30:48,258 WARN L234 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_cb20f275-35a4-4c63-b4bd-382495b0e9f6/sv-benchmarks/c/array-fpi/sina3.c[588,601] [2022-11-18 20:30:48,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:30:48,290 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:30:48,301 WARN L234 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_cb20f275-35a4-4c63-b4bd-382495b0e9f6/sv-benchmarks/c/array-fpi/sina3.c[588,601] [2022-11-18 20:30:48,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:30:48,321 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:30:48,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48 WrapperNode [2022-11-18 20:30:48,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:30:48,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:30:48,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:30:48,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:30:48,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,356 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2022-11-18 20:30:48,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:30:48,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:30:48,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:30:48,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:30:48,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,384 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:30:48,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:30:48,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:30:48,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:30:48,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (1/1) ... [2022-11-18 20:30:48,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:30:48,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:30:48,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:30:48,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:30:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:30:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:30:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:30:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:30:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:30:48,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:30:48,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:30:48,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:30:48,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:30:48,534 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:30:48,536 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:30:48,707 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:30:48,713 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:30:48,714 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-18 20:30:48,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:30:48 BoogieIcfgContainer [2022-11-18 20:30:48,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:30:48,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:30:48,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:30:48,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:30:48,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:30:48" (1/3) ... [2022-11-18 20:30:48,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdd97ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:30:48, skipping insertion in model container [2022-11-18 20:30:48,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:30:48" (2/3) ... [2022-11-18 20:30:48,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdd97ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:30:48, skipping insertion in model container [2022-11-18 20:30:48,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:30:48" (3/3) ... [2022-11-18 20:30:48,724 INFO L112 eAbstractionObserver]: Analyzing ICFG sina3.c [2022-11-18 20:30:48,743 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:30:48,744 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:30:48,800 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:30:48,807 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;@3a8295de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:30:48,807 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:30:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:30:48,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:30:48,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:48,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:48,821 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:48,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:48,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-11-18 20:30:48,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:48,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071572239] [2022-11-18 20:30:48,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:48,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:30:48,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:48,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071572239] [2022-11-18 20:30:48,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071572239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:48,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:48,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:30:48,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529196210] [2022-11-18 20:30:48,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:49,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:30:49,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:49,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:30:49,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:30:49,068 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:30:49,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:49,093 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-11-18 20:30:49,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:30:49,095 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-18 20:30:49,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:49,116 INFO L225 Difference]: With dead ends: 50 [2022-11-18 20:30:49,116 INFO L226 Difference]: Without dead ends: 23 [2022-11-18 20:30:49,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:30:49,122 INFO L413 NwaCegarLoop]: 32 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, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:49,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:30:49,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-18 20:30:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-18 20:30:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:30:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-18 20:30:49,166 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-11-18 20:30:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:49,166 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-18 20:30:49,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:30:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-18 20:30:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:30:49,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:49,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:49,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:30:49,169 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:49,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:49,170 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-11-18 20:30:49,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:49,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887489611] [2022-11-18 20:30:49,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:49,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:30:49,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:49,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887489611] [2022-11-18 20:30:49,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887489611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:30:49,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:30:49,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:30:49,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114031994] [2022-11-18 20:30:49,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:30:49,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:30:49,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:49,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:30:49,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:30:49,393 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:30:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:49,484 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-11-18 20:30:49,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:30:49,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-18 20:30:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:49,486 INFO L225 Difference]: With dead ends: 53 [2022-11-18 20:30:49,486 INFO L226 Difference]: Without dead ends: 37 [2022-11-18 20:30:49,486 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-11-18 20:30:49,488 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:49,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:30:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-18 20:30:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-11-18 20:30:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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-11-18 20:30:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-18 20:30:49,496 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-11-18 20:30:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:49,497 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-18 20:30:49,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:30:49,497 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-18 20:30:49,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:30:49,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:49,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:49,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:30:49,518 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:49,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-11-18 20:30:49,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:49,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822657096] [2022-11-18 20:30:49,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:49,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:30:52,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:52,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822657096] [2022-11-18 20:30:52,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822657096] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:30:52,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115891570] [2022-11-18 20:30:52,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:52,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:30:52,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:30:52,011 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:30:52,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:30:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:52,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-18 20:30:52,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:30:52,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:30:52,253 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:30:52,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 24 [2022-11-18 20:30:52,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:30:52,367 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 23 treesize of output 22 [2022-11-18 20:30:52,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:30:52,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-18 20:30:52,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:30:52,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-11-18 20:30:53,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:30:53,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-11-18 20:30:53,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:30:53,524 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:30:53,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 38 [2022-11-18 20:30:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:30:53,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:30:54,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:30:54,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:30:54,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:30:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:30:54,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115891570] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:30:54,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:30:54,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-11-18 20:30:54,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259154855] [2022-11-18 20:30:54,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:30:54,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-18 20:30:54,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:54,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-18 20:30:54,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2022-11-18 20:30:54,199 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 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-11-18 20:30:54,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:54,940 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-11-18 20:30:54,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:30:54,941 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 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) Word has length 24 [2022-11-18 20:30:54,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:54,942 INFO L225 Difference]: With dead ends: 55 [2022-11-18 20:30:54,942 INFO L226 Difference]: Without dead ends: 53 [2022-11-18 20:30:54,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2022-11-18 20:30:54,944 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 59 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:54,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 114 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 334 Invalid, 0 Unknown, 11 Unchecked, 0.4s Time] [2022-11-18 20:30:54,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-18 20:30:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-11-18 20:30:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 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-11-18 20:30:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-11-18 20:30:54,955 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2022-11-18 20:30:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:54,956 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-11-18 20:30:54,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 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-11-18 20:30:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-11-18 20:30:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:30:54,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:54,957 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:54,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:30:55,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-18 20:30:55,163 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:55,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2022-11-18 20:30:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:55,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18875643] [2022-11-18 20:30:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:55,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:30:55,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:55,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18875643] [2022-11-18 20:30:55,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18875643] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:30:55,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607985153] [2022-11-18 20:30:55,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:30:55,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:30:55,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:30:55,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:30:55,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:30:55,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:30:55,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:30:55,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:30:55,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:30:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:30:55,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:30:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:30:55,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607985153] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:30:55,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:30:55,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-18 20:30:55,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338225470] [2022-11-18 20:30:55,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:30:55,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:30:55,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:55,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:30:55,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:30:55,529 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:30:55,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:55,722 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-11-18 20:30:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:30:55,745 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-18 20:30:55,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:55,746 INFO L225 Difference]: With dead ends: 110 [2022-11-18 20:30:55,746 INFO L226 Difference]: Without dead ends: 66 [2022-11-18 20:30:55,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 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-11-18 20:30:55,748 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 56 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:55,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 61 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:30:55,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-18 20:30:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2022-11-18 20:30:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 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-11-18 20:30:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-11-18 20:30:55,757 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 26 [2022-11-18 20:30:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:55,758 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-11-18 20:30:55,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:30:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-11-18 20:30:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:30:55,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:55,760 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:55,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:30:55,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:30:55,967 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:55,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:55,967 INFO L85 PathProgramCache]: Analyzing trace with hash -587916192, now seen corresponding path program 3 times [2022-11-18 20:30:55,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:55,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920275725] [2022-11-18 20:30:55,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:55,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:30:56,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:56,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920275725] [2022-11-18 20:30:56,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920275725] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:30:56,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643012063] [2022-11-18 20:30:56,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:30:56,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:30:56,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:30:56,071 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:30:56,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:30:56,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-18 20:30:56,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:30:56,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:30:56,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:30:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:30:56,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:30:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:30:56,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643012063] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:30:56,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:30:56,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-18 20:30:56,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964249921] [2022-11-18 20:30:56,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:30:56,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:30:56,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:30:56,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:30:56,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:30:56,286 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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-11-18 20:30:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:30:56,445 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-11-18 20:30:56,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:30:56,445 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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) Word has length 26 [2022-11-18 20:30:56,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:30:56,446 INFO L225 Difference]: With dead ends: 63 [2022-11-18 20:30:56,446 INFO L226 Difference]: Without dead ends: 50 [2022-11-18 20:30:56,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 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-11-18 20:30:56,448 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 67 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:30:56,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 53 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:30:56,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-18 20:30:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2022-11-18 20:30:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:30:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-11-18 20:30:56,455 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2022-11-18 20:30:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:30:56,456 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-11-18 20:30:56,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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-11-18 20:30:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-11-18 20:30:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 20:30:56,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:30:56,457 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:30:56,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:30:56,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:30:56,668 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:30:56,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:30:56,669 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2022-11-18 20:30:56,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:30:56,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005837337] [2022-11-18 20:30:56,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:30:56,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:30:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:30:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:30:58,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:30:58,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005837337] [2022-11-18 20:30:58,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005837337] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:30:58,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707430079] [2022-11-18 20:30:58,965 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:30:58,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:30:58,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:30:58,968 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:30:58,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:30:59,085 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:30:59,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:30:59,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-18 20:30:59,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:30:59,114 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-11-18 20:30:59,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:30:59,124 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:30:59,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 24 [2022-11-18 20:30:59,192 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 23 treesize of output 22 [2022-11-18 20:30:59,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-18 20:30:59,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:30:59,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 51 [2022-11-18 20:31:00,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:31:00,013 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-18 20:31:00,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 61 [2022-11-18 20:31:00,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:31:00,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:31:00,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:31:00,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2022-11-18 20:31:00,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:31:00,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:31:00,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:31:00,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:31:00,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 47 [2022-11-18 20:31:01,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:31:01,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:31:01,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:31:01,209 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 20:31:01,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 62 [2022-11-18 20:31:01,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:31:01,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:31:01,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:31:01,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:31:01,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2022-11-18 20:31:01,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:31:01,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 34 [2022-11-18 20:31:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:31:01,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:31:22,044 WARN L233 SmtUtils]: Spent 13.74s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:31:35,951 WARN L233 SmtUtils]: Spent 13.45s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:31:54,452 WARN L233 SmtUtils]: Spent 16.50s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:31:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:31:54,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707430079] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:31:54,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:31:54,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 24] total 64 [2022-11-18 20:31:54,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853085082] [2022-11-18 20:31:54,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:31:54,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-18 20:31:54,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:31:54,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-18 20:31:54,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=3579, Unknown=1, NotChecked=0, Total=4032 [2022-11-18 20:31:54,495 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 64 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:08,693 WARN L233 SmtUtils]: Spent 11.21s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:32:21,826 WARN L233 SmtUtils]: Spent 10.77s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:32:29,644 WARN L233 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:32:36,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:36,810 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2022-11-18 20:32:36,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-18 20:32:36,811 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-18 20:32:36,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:36,812 INFO L225 Difference]: With dead ends: 95 [2022-11-18 20:32:36,812 INFO L226 Difference]: Without dead ends: 93 [2022-11-18 20:32:36,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2548 ImplicationChecksByTransitivity, 96.3s TimeCoverageRelationStatistics Valid=970, Invalid=7398, Unknown=4, NotChecked=0, Total=8372 [2022-11-18 20:32:36,816 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 418 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:36,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 199 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 252 Invalid, 0 Unknown, 418 Unchecked, 0.4s Time] [2022-11-18 20:32:36,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-18 20:32:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2022-11-18 20:32:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 81 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-11-18 20:32:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2022-11-18 20:32:36,834 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 32 [2022-11-18 20:32:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:36,835 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2022-11-18 20:32:36,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2022-11-18 20:32:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 20:32:36,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:36,837 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:36,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-18 20:32:37,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-18 20:32:37,042 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:37,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:37,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1696042328, now seen corresponding path program 5 times [2022-11-18 20:32:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:37,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240630905] [2022-11-18 20:32:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:37,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 20:32:37,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:37,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240630905] [2022-11-18 20:32:37,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240630905] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:37,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903535808] [2022-11-18 20:32:37,189 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:32:37,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:37,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:37,191 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:37,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:32:37,368 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-18 20:32:37,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:32:37,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:32:37,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 20:32:37,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 20:32:37,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903535808] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:32:37,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:32:37,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-18 20:32:37,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105123217] [2022-11-18 20:32:37,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:32:37,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:32:37,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:37,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:32:37,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:32:37,561 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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-11-18 20:32:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:32:37,845 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2022-11-18 20:32:37,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:32:37,846 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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) Word has length 34 [2022-11-18 20:32:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:32:37,846 INFO L225 Difference]: With dead ends: 175 [2022-11-18 20:32:37,846 INFO L226 Difference]: Without dead ends: 132 [2022-11-18 20:32:37,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:32:37,847 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 97 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:32:37,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 73 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:32:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-18 20:32:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 93. [2022-11-18 20:32:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.141304347826087) internal successors, (105), 92 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:32:37,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2022-11-18 20:32:37,878 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 34 [2022-11-18 20:32:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:32:37,879 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2022-11-18 20:32:37,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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-11-18 20:32:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2022-11-18 20:32:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 20:32:37,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:32:37,881 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:32:37,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:32:38,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:38,087 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:32:38,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:32:38,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2022-11-18 20:32:38,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:32:38,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975224464] [2022-11-18 20:32:38,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:38,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:32:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 20:32:40,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:32:40,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975224464] [2022-11-18 20:32:40,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975224464] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:32:40,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881880406] [2022-11-18 20:32:40,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:32:40,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:32:40,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:32:40,319 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:32:40,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:32:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:32:40,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-18 20:32:40,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:32:40,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:32:40,446 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-11-18 20:32:40,658 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-11-18 20:32:40,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:32:40,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 20:32:40,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:32:40,957 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 23 treesize of output 23 [2022-11-18 20:32:41,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:32:41,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:32:41,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 20:32:41,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:32:41,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:32:41,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:32:41,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:32:41,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-18 20:32:41,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:32:41,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:32:41,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:32:41,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2022-11-18 20:32:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 20:32:42,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:32:43,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:43,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 77 [2022-11-18 20:32:46,200 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (= (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) .cse2)))) is different from false [2022-11-18 20:32:49,295 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse0 (+ (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (= .cse0 (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) is different from false [2022-11-18 20:32:52,073 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (= (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) .cse2)))) is different from false [2022-11-18 20:32:52,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:52,269 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 216 treesize of output 102 [2022-11-18 20:32:52,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:52,347 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 2287 treesize of output 2067 [2022-11-18 20:32:52,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:52,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 2366 treesize of output 1960 [2022-11-18 20:32:53,331 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-18 20:32:53,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2438 treesize of output 1 [2022-11-18 20:32:54,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:32:54,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 321 treesize of output 282 [2022-11-18 20:32:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2022-11-18 20:32:56,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881880406] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:32:56,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:32:56,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 18] total 51 [2022-11-18 20:32:56,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213139344] [2022-11-18 20:32:56,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:32:56,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-18 20:32:56,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:32:56,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-18 20:32:56,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2011, Unknown=3, NotChecked=282, Total=2550 [2022-11-18 20:32:56,765 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 51 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 51 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:06,905 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ .cse4 4 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse2 (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (= (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) .cse2)))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse3 (+ .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-11-18 20:33:19,981 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) .cse0 (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse1 (+ (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (= .cse1 (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse1)))) (+ (select (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (and (= (select .cse4 4) 1) (= (select .cse4 0) 1) .cse0) (<= (+ .cse5 1 |c_ULTIMATE.start_main_~b~0#1.offset|) (* c_~N~0 4))) (= (select .cse4 (+ .cse5 (- 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) 1) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-11-18 20:33:22,353 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (and (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (and (= (select .cse0 .cse1) 1) (= (select .cse0 0) 1) .cse2) (not (= .cse1 4))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse6 (+ (select (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (= (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse6)))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) .cse4))) .cse6)))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) .cse2 (or (<= 2 c_~N~0) (not (<= .cse1 3))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 .cse4) 1) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-11-18 20:33:24,725 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (and (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse3 (+ (select (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))) (= (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) .cse1))) .cse3)))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse4 .cse1) 1))) is different from false [2022-11-18 20:33:26,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:26,311 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2022-11-18 20:33:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-18 20:33:26,311 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 51 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-18 20:33:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:26,313 INFO L225 Difference]: With dead ends: 108 [2022-11-18 20:33:26,313 INFO L226 Difference]: Without dead ends: 81 [2022-11-18 20:33:26,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 40.0s TimeCoverageRelationStatistics Valid=364, Invalid=2737, Unknown=7, NotChecked=798, Total=3906 [2022-11-18 20:33:26,315 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:33:26,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 170 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 334 Invalid, 0 Unknown, 114 Unchecked, 1.6s Time] [2022-11-18 20:33:26,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-18 20:33:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-11-18 20:33:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.141025641025641) internal successors, (89), 78 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-11-18 20:33:26,331 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 36 [2022-11-18 20:33:26,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:26,332 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-11-18 20:33:26,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 51 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:26,332 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-11-18 20:33:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 20:33:26,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:26,333 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:33:26,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-18 20:33:26,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:33:26,539 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:26,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:26,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1245131882, now seen corresponding path program 6 times [2022-11-18 20:33:26,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:26,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649022895] [2022-11-18 20:33:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:26,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-18 20:33:27,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:33:27,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649022895] [2022-11-18 20:33:27,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649022895] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:33:27,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512648950] [2022-11-18 20:33:27,053 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:33:27,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:33:27,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:33:27,055 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:33:27,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:33:27,173 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-18 20:33:27,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:33:27,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:33:27,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:33:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-18 20:33:27,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:33:28,419 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-18 20:33:28,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512648950] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:33:28,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:33:28,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-18 20:33:28,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311041310] [2022-11-18 20:33:28,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:33:28,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:33:28,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:33:28,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:33:28,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:33:28,421 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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-11-18 20:33:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:29,970 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-11-18 20:33:29,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:33:29,971 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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) Word has length 36 [2022-11-18 20:33:29,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:29,971 INFO L225 Difference]: With dead ends: 102 [2022-11-18 20:33:29,971 INFO L226 Difference]: Without dead ends: 74 [2022-11-18 20:33:29,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:33:29,972 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 111 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:33:29,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 85 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-18 20:33:29,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-18 20:33:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 43. [2022-11-18 20:33:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:33:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-18 20:33:29,985 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 36 [2022-11-18 20:33:29,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:29,985 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-18 20:33:29,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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-11-18 20:33:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-18 20:33:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-18 20:33:29,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:29,987 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:33:29,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:33:30,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:33:30,191 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:30,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221586, now seen corresponding path program 7 times [2022-11-18 20:33:30,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:30,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193446851] [2022-11-18 20:33:30,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:30,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:33:40,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:33:40,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193446851] [2022-11-18 20:33:40,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193446851] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:33:40,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641413881] [2022-11-18 20:33:40,645 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 20:33:40,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:33:40,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:33:40,647 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:33:40,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:33:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:40,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-18 20:33:40,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:33:41,276 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:33:41,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-11-18 20:33:41,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:33:41,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 20:33:42,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-18 20:33:43,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:43,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:43,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:43,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-18 20:33:44,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:44,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:44,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2022-11-18 20:33:45,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:45,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:45,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:45,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 67 [2022-11-18 20:33:45,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:45,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:45,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:45,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 67 [2022-11-18 20:33:46,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:46,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:46,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:46,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:46,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:33:46,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2022-11-18 20:33:47,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:47,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:47,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:47,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:33:47,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-11-18 20:33:48,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:48,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:48,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:48,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:33:48,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:48,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-11-18 20:33:49,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:49,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:49,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:33:49,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:33:49,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:49,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2022-11-18 20:33:50,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:50,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:50,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:50,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:50,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:50,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:33:50,827 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:33:50,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62 [2022-11-18 20:33:51,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:51,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:33:51,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:33:51,723 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:33:51,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 46 [2022-11-18 20:33:52,802 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:33:52,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2022-11-18 20:33:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:33:53,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:34:51,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:34:51,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:34:51,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:34:51,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:34:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:34:51,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641413881] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:34:51,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:34:51,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 29] total 81 [2022-11-18 20:34:51,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79006144] [2022-11-18 20:34:51,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:34:51,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-18 20:34:51,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:51,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-18 20:34:51,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=5910, Unknown=6, NotChecked=0, Total=6480 [2022-11-18 20:34:51,487 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 81 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:08,989 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-11-18 20:35:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-18 20:35:08,990 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 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 40 [2022-11-18 20:35:08,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:08,991 INFO L225 Difference]: With dead ends: 99 [2022-11-18 20:35:08,991 INFO L226 Difference]: Without dead ends: 97 [2022-11-18 20:35:08,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4573 ImplicationChecksByTransitivity, 85.0s TimeCoverageRelationStatistics Valid=1135, Invalid=11069, Unknown=6, NotChecked=0, Total=12210 [2022-11-18 20:35:08,995 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 95 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 569 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:35:08,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 154 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 585 Invalid, 0 Unknown, 569 Unchecked, 3.1s Time] [2022-11-18 20:35:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-18 20:35:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-11-18 20:35:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 75 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-11-18 20:35:09,016 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 40 [2022-11-18 20:35:09,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:09,016 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-11-18 20:35:09,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-11-18 20:35:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-18 20:35:09,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:09,018 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:35:09,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:35:09,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:35:09,223 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:09,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:09,223 INFO L85 PathProgramCache]: Analyzing trace with hash 524150480, now seen corresponding path program 8 times [2022-11-18 20:35:09,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:09,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109559959] [2022-11-18 20:35:09,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:09,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 20:35:09,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:09,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109559959] [2022-11-18 20:35:09,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109559959] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:35:09,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453447894] [2022-11-18 20:35:09,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:35:09,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:35:09,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:35:09,891 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:35:09,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:35:10,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:35:10,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:35:10,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 20:35:10,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:35:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 20:35:10,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:35:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 20:35:11,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453447894] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:35:11,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:35:11,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-18 20:35:11,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564029223] [2022-11-18 20:35:11,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:35:11,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:35:11,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:11,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:35:11,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:35:11,293 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:12,612 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2022-11-18 20:35:12,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:35:12,612 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-18 20:35:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:12,613 INFO L225 Difference]: With dead ends: 186 [2022-11-18 20:35:12,613 INFO L226 Difference]: Without dead ends: 141 [2022-11-18 20:35:12,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 70 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:35:12,615 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 175 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:35:12,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 95 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-18 20:35:12,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-18 20:35:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2022-11-18 20:35:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.1057692307692308) internal successors, (115), 104 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2022-11-18 20:35:12,638 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 42 [2022-11-18 20:35:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:12,638 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2022-11-18 20:35:12,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2022-11-18 20:35:12,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-18 20:35:12,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:12,639 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:35:12,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:35:12,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:35:12,840 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:12,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:12,840 INFO L85 PathProgramCache]: Analyzing trace with hash -308361392, now seen corresponding path program 9 times [2022-11-18 20:35:12,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:12,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261026301] [2022-11-18 20:35:12,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:12,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 20:35:13,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:13,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261026301] [2022-11-18 20:35:13,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261026301] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:35:13,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774335900] [2022-11-18 20:35:13,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:35:13,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:35:13,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:35:13,428 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:35:13,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:35:13,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-18 20:35:13,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:35:13,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-18 20:35:13,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:35:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 20:35:14,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:35:14,683 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 20:35:14,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774335900] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:35:14,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:35:14,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-11-18 20:35:14,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482384534] [2022-11-18 20:35:14,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:35:14,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:35:14,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:14,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:35:14,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:35:14,684 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:17,186 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-11-18 20:35:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:35:17,187 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-18 20:35:17,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:17,187 INFO L225 Difference]: With dead ends: 146 [2022-11-18 20:35:17,188 INFO L226 Difference]: Without dead ends: 117 [2022-11-18 20:35:17,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-11-18 20:35:17,189 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 206 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:35:17,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 151 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-18 20:35:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-18 20:35:17,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 86. [2022-11-18 20:35:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-11-18 20:35:17,221 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 42 [2022-11-18 20:35:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:17,222 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-11-18 20:35:17,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:35:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-11-18 20:35:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-18 20:35:17,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:17,226 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:35:17,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:35:17,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:35:17,427 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:17,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:17,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2112995272, now seen corresponding path program 2 times [2022-11-18 20:35:17,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:17,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146866237] [2022-11-18 20:35:17,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:17,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:28,199 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:35:28,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:28,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146866237] [2022-11-18 20:35:28,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146866237] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:35:28,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410003735] [2022-11-18 20:35:28,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:35:28,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:35:28,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:35:28,201 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:35:28,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:35:28,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:35:28,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:35:28,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-18 20:35:28,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:35:28,881 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-11-18 20:35:28,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:28,926 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:35:28,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 24 [2022-11-18 20:35:29,306 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 23 treesize of output 22 [2022-11-18 20:35:30,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-18 20:35:30,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-11-18 20:35:32,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:32,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-11-18 20:35:33,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:33,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:33,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:33,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-18 20:35:34,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:34,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:34,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:34,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-11-18 20:35:35,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:35,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:35:35,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:35,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:35,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-11-18 20:35:36,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:36,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:36,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:36,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:36,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:36,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:35:36,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2022-11-18 20:35:37,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:37,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:37,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:37,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2022-11-18 20:35:39,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:39,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2022-11-18 20:35:39,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:39,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:39,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2022-11-18 20:35:40,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:40,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:35:40,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-11-18 20:35:40,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:40,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2022-11-18 20:35:42,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:35:42,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 34 [2022-11-18 20:35:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:35:43,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:35:46,538 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array Int Int)) (v_ArrVal_765 Int)) (= (select (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store v_ArrVal_761 (+ .cse0 8 |c_ULTIMATE.start_main_~a~0#1.offset|) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_761))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ .cse0 16 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765)) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ c_~N~0 1))) is different from false [2022-11-18 20:35:46,563 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_761))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1))) is different from false [2022-11-18 20:35:47,414 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_761))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1))) is different from false [2022-11-18 20:35:47,446 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_761))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ c_~N~0 1))) is different from false [2022-11-18 20:35:47,476 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse2 .cse3)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_761))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1))) is different from false [2022-11-18 20:35:47,517 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse5 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse4))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_761))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1))) is different from false [2022-11-18 20:35:47,551 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse4)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_761))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1))) is different from false [2022-11-18 20:35:47,620 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array Int Int)) (v_ArrVal_754 Int)) (= (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_754)))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse3 .cse4 .cse5))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_761))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1))) is different from false [2022-11-18 20:35:47,657 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array Int Int)) (v_ArrVal_754 Int)) (= (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_754)))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse3 .cse4 .cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_761))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1))) is different from false [2022-11-18 20:35:47,708 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array Int Int)) (v_ArrVal_754 Int)) (= (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ .cse6 4 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_754))))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse3 .cse4 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse5))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_761))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1))) is different from false [2022-11-18 20:35:47,770 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array Int Int)) (v_ArrVal_754 Int)) (= (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse6 4 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ .cse6 8 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_754))))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse3 .cse4 .cse5))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_761))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (+ c_~N~0 1))) is different from false [2022-11-18 20:35:47,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:35:47,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 817 treesize of output 328 [2022-11-18 20:35:47,961 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (or (= (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_3))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse4 .cse5))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_761))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ c_~N~0 1)) (not (= (select v_arrayElimArr_3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) 1)))) is different from false [2022-11-18 20:35:48,013 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse0 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (or (not (= (select v_arrayElimArr_3 .cse0) 1)) (= (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_arrayElimArr_3))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse5 .cse6))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_761))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) .cse0) (select (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ c_~N~0 1))))) is different from false [2022-11-18 20:36:11,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:36:11,354 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-18 20:36:11,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 1251 treesize of output 1 [2022-11-18 20:36:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2022-11-18 20:36:11,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410003735] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:11,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:36:11,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 89 [2022-11-18 20:36:11,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76107229] [2022-11-18 20:36:11,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:11,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-11-18 20:36:11,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:11,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-11-18 20:36:11,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=5055, Unknown=30, NotChecked=2080, Total=7832 [2022-11-18 20:36:11,361 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 89 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 89 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:35,164 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-11-18 20:36:35,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-18 20:36:35,165 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 89 states have internal predecessors, (123), 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-11-18 20:36:35,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:35,166 INFO L225 Difference]: With dead ends: 92 [2022-11-18 20:36:35,166 INFO L226 Difference]: Without dead ends: 90 [2022-11-18 20:36:35,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 34 SyntacticMatches, 13 SemanticMatches, 106 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 3910 ImplicationChecksByTransitivity, 61.0s TimeCoverageRelationStatistics Valid=951, Invalid=7999, Unknown=32, NotChecked=2574, Total=11556 [2022-11-18 20:36:35,169 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 112 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 2207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1196 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:35,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 359 Invalid, 2207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 923 Invalid, 0 Unknown, 1196 Unchecked, 5.8s Time] [2022-11-18 20:36:35,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-18 20:36:35,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2022-11-18 20:36:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-11-18 20:36:35,192 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 44 [2022-11-18 20:36:35,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:35,192 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-11-18 20:36:35,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 89 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:36:35,193 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-11-18 20:36:35,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 20:36:35,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:35,193 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:36:35,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-18 20:36:35,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:35,399 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:35,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:35,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1258986306, now seen corresponding path program 3 times [2022-11-18 20:36:35,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:35,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514708273] [2022-11-18 20:36:35,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:35,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:36:48,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:48,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514708273] [2022-11-18 20:36:48,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514708273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:48,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645285549] [2022-11-18 20:36:48,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:36:48,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:48,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:48,628 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:48,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb20f275-35a4-4c63-b4bd-382495b0e9f6/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 20:36:48,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-18 20:36:48,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:36:48,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-18 20:36:48,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:48,807 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 12 [2022-11-18 20:36:50,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-18 20:36:51,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-18 20:36:52,717 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 25 [2022-11-18 20:36:52,899 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 25 [2022-11-18 20:36:53,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-18 20:36:53,927 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 25 [2022-11-18 20:36:54,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:54,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2022-11-18 20:36:55,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:55,345 INFO L321 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-11-18 20:36:55,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 64 [2022-11-18 20:37:01,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:37:01,762 INFO L321 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2022-11-18 20:37:01,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 57 [2022-11-18 20:37:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 20:37:02,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:37:08,398 WARN L837 $PredicateComparison]: unable to prove that (or (not (< 2 c_~N~0)) (forall ((v_ArrVal_848 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_250| Int)) (let ((.cse0 (let ((.cse2 (store v_ArrVal_848 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_848))) (+ (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_250|)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_250| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse1 (+ c_~N~0 1))) (or (not (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse1)) (< (+ |v_ULTIMATE.start_main_~i~0#1_250| 1) c_~N~0) (= (select .cse0 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse1) (not (< |v_ULTIMATE.start_main_~i~0#1_250| c_~N~0)))))) is different from false [2022-11-18 20:37:08,558 WARN L837 $PredicateComparison]: unable to prove that (or (not (< 2 c_~N~0)) (forall ((v_ArrVal_848 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_250| Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store v_ArrVal_848 .cse2 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_848))) (+ (select (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_250|)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3))) (+ (select (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_250| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))))))) (.cse1 (+ c_~N~0 1))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_250| 1) c_~N~0) (= (select .cse0 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse1) (not (= (select .cse0 .cse2) .cse1)) (not (< |v_ULTIMATE.start_main_~i~0#1_250| c_~N~0))))))) is different from false [2022-11-18 20:37:08,937 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_250| Int) (v_ArrVal_846 Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_846)))) (let ((.cse3 (store v_ArrVal_848 .cse2 (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_848))) (+ (select (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) (store .cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_250|)) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3))) (+ (select (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_250| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (.cse1 (+ c_~N~0 1))) (or (= (select .cse0 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse1) (< (+ |v_ULTIMATE.start_main_~i~0#1_250| 1) c_~N~0) (not (= (select .cse0 .cse2) .cse1)) (not (< |v_ULTIMATE.start_main_~i~0#1_250| c_~N~0)))))) (not (< 2 c_~N~0))) is different from false [2022-11-18 20:37:09,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:09,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 308 treesize of output 266 [2022-11-18 20:37:09,260 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_250| Int)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (store v_ArrVal_848 .cse1 (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_848))) (+ (select (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) (store .cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_250|)) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3))) (+ (select (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_250| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (.cse2 (+ c_~N~0 1))) (or (not (= (select .cse0 .cse1) .cse2)) (< (+ |v_ULTIMATE.start_main_~i~0#1_250| 1) c_~N~0) (= (select .cse0 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse2) (not (< |v_ULTIMATE.start_main_~i~0#1_250| c_~N~0)))))) (not (< 2 c_~N~0))) is different from false [2022-11-18 20:37:09,776 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_250| Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (store v_ArrVal_848 .cse2 (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_848))) (+ (select (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) (store .cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_250|)) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3))) (+ (select (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_250| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) (let ((.cse0 (select .cse1 .cse2))) (or (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_250|) .cse0) (= .cse0 (select .cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_250| 1) .cse0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) .cse0) (not (< 3 .cse0))))))) is different from false [2022-11-18 20:37:09,937 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_250| Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (store v_ArrVal_848 .cse2 (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_848))) (+ (select (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) (store .cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_250|)) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3))) (+ (select (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_250| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) (let ((.cse0 (select .cse1 .cse2))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) .cse0) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_250|) .cse0) (= .cse0 (select .cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_250| 1) .cse0)) (not (< 3 .cse0))))))) is different from false [2022-11-18 20:37:10,127 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_250| Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (store v_ArrVal_848 .cse2 (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_848))) (+ (select (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) (store .cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_250|)) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3))) (+ (select (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_250| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) (let ((.cse0 (select .cse1 .cse2))) (or (= .cse0 (select .cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_250|) .cse0) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_250| 1) .cse0)) (not (< 3 .cse0)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) .cse0)))))) is different from false [2022-11-18 20:37:10,319 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_848 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_250| Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (store v_ArrVal_848 .cse2 (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_848))) (+ (select (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_250|)) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse3))) (+ (select (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_250| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) (let ((.cse0 (select .cse1 .cse2))) (or (not (< 3 .cse0)) (= (select .cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_250|) .cse0) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) .cse0) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_250| 1) .cse0))))))) is different from false [2022-11-18 20:37:10,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:37:10,421 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 1728 treesize of output 793 [2022-11-18 20:37:11,399 INFO L321 Elim1Store]: treesize reduction 20, result has 64.9 percent of original size [2022-11-18 20:37:11,401 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 93157 treesize of output 85496 [2022-11-18 20:37:13,774 INFO L321 Elim1Store]: treesize reduction 10, result has 85.1 percent of original size [2022-11-18 20:37:13,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 164212 treesize of output 139292 [2022-11-18 20:37:17,762 INFO L321 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2022-11-18 20:37:17,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133960 treesize of output 120310