./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/splice-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/splice-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc --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 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:55:53,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:55:53,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:55:53,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:55:53,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:55:53,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:55:53,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:55:53,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:55:53,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:55:53,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:55:53,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:55:53,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:55:53,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:55:53,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:55:53,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:55:53,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:55:53,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:55:53,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:55:53,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:55:53,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:55:53,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:55:53,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:55:53,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:55:53,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:55:53,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:55:53,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:55:53,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:55:53,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:55:53,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:55:53,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:55:53,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:55:53,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:55:53,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:55:53,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:55:53,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:55:53,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:55:53,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:55:53,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:55:53,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:55:53,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:55:53,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:55:53,541 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:55:53,578 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:55:53,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:55:53,580 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:55:53,580 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:55:53,581 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:55:53,581 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:55:53,581 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:55:53,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:55:53,582 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:55:53,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:55:53,583 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:55:53,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:55:53,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:55:53,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:55:53,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:55:53,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:55:53,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:55:53,585 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:55:53,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:55:53,585 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:55:53,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:55:53,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:55:53,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:55:53,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:55:53,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:55:53,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:55:53,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:55:53,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:55:53,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:55:53,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:55:53,589 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:55:53,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:55:53,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:55:53,590 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_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/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_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc 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 -> 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc [2022-11-02 20:55:53,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:55:53,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:55:53,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:55:53,911 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:55:53,912 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:55:53,913 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-properties/splice-2.i [2022-11-02 20:55:54,031 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/data/35d35ccbc/9a94b94c97264dcb8ba7d362f70e0d5a/FLAG5586efffc [2022-11-02 20:55:54,476 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:55:54,477 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/sv-benchmarks/c/list-properties/splice-2.i [2022-11-02 20:55:54,495 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/data/35d35ccbc/9a94b94c97264dcb8ba7d362f70e0d5a/FLAG5586efffc [2022-11-02 20:55:54,813 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/data/35d35ccbc/9a94b94c97264dcb8ba7d362f70e0d5a [2022-11-02 20:55:54,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:55:54,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:55:54,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:55:54,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:55:54,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:55:54,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:55:54" (1/1) ... [2022-11-02 20:55:54,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30343910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:54, skipping insertion in model container [2022-11-02 20:55:54,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:55:54" (1/1) ... [2022-11-02 20:55:54,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:55:54,888 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:55:55,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2022-11-02 20:55:55,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:55:55,261 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:55:55,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2022-11-02 20:55:55,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:55:55,345 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:55:55,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:55 WrapperNode [2022-11-02 20:55:55,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:55:55,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:55:55,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:55:55,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:55:55,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:55" (1/1) ... [2022-11-02 20:55:55,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:55" (1/1) ... [2022-11-02 20:55:55,389 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 104 [2022-11-02 20:55:55,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:55:55,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:55:55,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:55:55,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:55:55,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:55" (1/1) ... [2022-11-02 20:55:55,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:55" (1/1) ... [2022-11-02 20:55:55,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:55" (1/1) ... [2022-11-02 20:55:55,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:55" (1/1) ... [2022-11-02 20:55:55,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:55" (1/1) ... [2022-11-02 20:55:55,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:55" (1/1) ... [2022-11-02 20:55:55,423 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:55" (1/1) ... [2022-11-02 20:55:55,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:55" (1/1) ... [2022-11-02 20:55:55,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:55:55,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:55:55,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:55:55,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:55:55,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:55" (1/1) ... [2022-11-02 20:55:55,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:55:55,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:55,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:55:55,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:55:55,521 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-02 20:55:55,521 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-02 20:55:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:55:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:55:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:55:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:55:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:55:55,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:55:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:55:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:55:55,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:55:55,638 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:55:55,640 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:55:55,680 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-02 20:55:55,820 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:55:55,827 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:55:55,827 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:55:55,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:55 BoogieIcfgContainer [2022-11-02 20:55:55,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:55:55,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:55:55,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:55:55,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:55:55,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:55:54" (1/3) ... [2022-11-02 20:55:55,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22492bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:55:55, skipping insertion in model container [2022-11-02 20:55:55,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:55:55" (2/3) ... [2022-11-02 20:55:55,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22492bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:55:55, skipping insertion in model container [2022-11-02 20:55:55,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:55:55" (3/3) ... [2022-11-02 20:55:55,839 INFO L112 eAbstractionObserver]: Analyzing ICFG splice-2.i [2022-11-02 20:55:55,858 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:55:55,858 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:55:55,906 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:55:55,912 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;@1f413f9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:55:55,913 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:55:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:55:55,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:55,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:55,950 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:55,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1192551972, now seen corresponding path program 1 times [2022-11-02 20:55:55,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:55,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561209366] [2022-11-02 20:55:55,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:55,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:56,204 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-02 20:55:56,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:56,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561209366] [2022-11-02 20:55:56,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561209366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:56,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:56,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:56,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629714079] [2022-11-02 20:55:56,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:56,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:55:56,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:56,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:55:56,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:55:56,253 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-02 20:55:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:56,277 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2022-11-02 20:55:56,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:55:56,280 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-11-02 20:55:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:56,287 INFO L225 Difference]: With dead ends: 48 [2022-11-02 20:55:56,287 INFO L226 Difference]: Without dead ends: 23 [2022-11-02 20:55:56,290 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-02 20:55:56,293 INFO L413 NwaCegarLoop]: 40 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, 40 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-02 20:55:56,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:55:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-02 20:55:56,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-02 20:55:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-11-02 20:55:56,327 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-11-02 20:55:56,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:56,327 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-11-02 20:55:56,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-02 20:55:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-11-02 20:55:56,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:55:56,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:56,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:56,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:55:56,329 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:56,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash 675462707, now seen corresponding path program 1 times [2022-11-02 20:55:56,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:56,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668723207] [2022-11-02 20:55:56,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:56,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:56,582 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-02 20:55:56,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:56,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668723207] [2022-11-02 20:55:56,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668723207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:56,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:56,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:55:56,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662621552] [2022-11-02 20:55:56,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:56,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:55:56,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:56,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:55:56,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:55:56,587 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-02 20:55:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:56,676 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-11-02 20:55:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:55:56,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-11-02 20:55:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:56,678 INFO L225 Difference]: With dead ends: 40 [2022-11-02 20:55:56,678 INFO L226 Difference]: Without dead ends: 33 [2022-11-02 20:55:56,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:55:56,680 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:56,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:55:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-02 20:55:56,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-11-02 20:55:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 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-02 20:55:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-11-02 20:55:56,688 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2022-11-02 20:55:56,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:56,688 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-11-02 20:55:56,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-02 20:55:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-11-02 20:55:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:55:56,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:56,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:56,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:55:56,690 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:56,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash 577924040, now seen corresponding path program 1 times [2022-11-02 20:55:56,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:56,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763261110] [2022-11-02 20:55:56,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:56,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:56,815 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-02 20:55:56,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:56,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763261110] [2022-11-02 20:55:56,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763261110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:56,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:56,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:55:56,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694035522] [2022-11-02 20:55:56,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:56,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:55:56,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:56,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:55:56,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:55:56,819 INFO L87 Difference]: Start difference. First operand 28 states and 36 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-02 20:55:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:56,890 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-11-02 20:55:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:55:56,891 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-02 20:55:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:56,893 INFO L225 Difference]: With dead ends: 47 [2022-11-02 20:55:56,893 INFO L226 Difference]: Without dead ends: 39 [2022-11-02 20:55:56,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:55:56,895 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:56,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:55:56,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-02 20:55:56,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-11-02 20:55:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:56,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-11-02 20:55:56,916 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 16 [2022-11-02 20:55:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:56,917 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-11-02 20:55:56,917 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-02 20:55:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-11-02 20:55:56,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:55:56,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:56,919 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:56,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:55:56,919 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:56,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1645466066, now seen corresponding path program 1 times [2022-11-02 20:55:56,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:56,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390151625] [2022-11-02 20:55:56,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:56,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:57,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:57,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390151625] [2022-11-02 20:55:57,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390151625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:57,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:57,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:55:57,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40438002] [2022-11-02 20:55:57,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:57,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:57,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:57,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:57,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:57,188 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:57,323 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2022-11-02 20:55:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:57,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:55:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:57,325 INFO L225 Difference]: With dead ends: 70 [2022-11-02 20:55:57,326 INFO L226 Difference]: Without dead ends: 43 [2022-11-02 20:55:57,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:55:57,329 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:57,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 78 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:55:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-02 20:55:57,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-11-02 20:55:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-11-02 20:55:57,343 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 17 [2022-11-02 20:55:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:57,344 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-11-02 20:55:57,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:57,344 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-11-02 20:55:57,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:55:57,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:57,346 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] [2022-11-02 20:55:57,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:55:57,347 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:57,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:57,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1334445095, now seen corresponding path program 1 times [2022-11-02 20:55:57,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:57,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252947244] [2022-11-02 20:55:57,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:57,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:58,129 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-02 20:55:58,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:58,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252947244] [2022-11-02 20:55:58,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252947244] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:58,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69826321] [2022-11-02 20:55:58,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:58,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:58,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:58,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:58,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:55:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:58,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-02 20:55:58,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:58,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:55:58,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:58,495 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:55:58,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-02 20:55:58,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:58,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:55:58,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:55:58,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:55:58,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:55:58,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:55:58,761 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-02 20:55:58,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:55:58,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_102 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 20:55:58,872 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_98 Int) (v_ArrVal_102 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_98)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 20:55:58,953 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:55:58,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 29 [2022-11-02 20:55:58,966 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:55:58,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-11-02 20:55:58,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-11-02 20:55:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:55:59,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69826321] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:55:59,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:55:59,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-11-02 20:55:59,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831654150] [2022-11-02 20:55:59,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:55:59,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-02 20:55:59,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:59,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 20:55:59,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=389, Unknown=2, NotChecked=82, Total=552 [2022-11-02 20:55:59,158 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:04,124 INFO L93 Difference]: Finished difference Result 138 states and 177 transitions. [2022-11-02 20:56:04,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:56:04,124 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 20:56:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:04,126 INFO L225 Difference]: With dead ends: 138 [2022-11-02 20:56:04,126 INFO L226 Difference]: Without dead ends: 105 [2022-11-02 20:56:04,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=293, Invalid=1514, Unknown=7, NotChecked=166, Total=1980 [2022-11-02 20:56:04,128 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 98 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:04,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 259 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 344 Invalid, 0 Unknown, 165 Unchecked, 0.3s Time] [2022-11-02 20:56:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-02 20:56:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 61. [2022-11-02 20:56:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 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-02 20:56:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2022-11-02 20:56:04,140 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 23 [2022-11-02 20:56:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:04,140 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-11-02 20:56:04,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2022-11-02 20:56:04,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:56:04,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:04,142 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] [2022-11-02 20:56:04,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:56:04,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:04,367 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:04,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1115102530, now seen corresponding path program 1 times [2022-11-02 20:56:04,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:04,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397975365] [2022-11-02 20:56:04,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:04,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:04,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:04,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397975365] [2022-11-02 20:56:04,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397975365] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:04,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469297626] [2022-11-02 20:56:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:04,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:04,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:04,457 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:56:04,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:56:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:04,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:56:04,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:56:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:56:04,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:56:04,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469297626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:04,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:56:04,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-02 20:56:04,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098686609] [2022-11-02 20:56:04,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:04,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:04,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:04,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:04,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:56:04,575 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:04,595 INFO L93 Difference]: Finished difference Result 115 states and 149 transitions. [2022-11-02 20:56:04,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:04,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:56:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:04,600 INFO L225 Difference]: With dead ends: 115 [2022-11-02 20:56:04,600 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 20:56:04,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:56:04,605 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:04,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 60 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:56:04,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 20:56:04,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2022-11-02 20:56:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 69 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-02 20:56:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2022-11-02 20:56:04,627 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 25 [2022-11-02 20:56:04,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:04,627 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2022-11-02 20:56:04,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:04,627 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2022-11-02 20:56:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:56:04,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:04,632 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:04,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:56:04,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:56:04,859 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:04,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:04,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1793450878, now seen corresponding path program 1 times [2022-11-02 20:56:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:04,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323994300] [2022-11-02 20:56:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:04,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:05,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:05,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323994300] [2022-11-02 20:56:05,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323994300] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:05,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882664992] [2022-11-02 20:56:05,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:05,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:05,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:05,419 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:56:05,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:56:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:05,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-02 20:56:05,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:56:05,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:56:05,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:56:05,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:56:05,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:56:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:56:05,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:56:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:56:05,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882664992] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:56:05,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:56:05,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-11-02 20:56:05,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758366895] [2022-11-02 20:56:05,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:56:05,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:56:05,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:05,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:56:05,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:56:05,728 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:05,952 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-11-02 20:56:05,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:56:05,953 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:56:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:05,953 INFO L225 Difference]: With dead ends: 83 [2022-11-02 20:56:05,953 INFO L226 Difference]: Without dead ends: 75 [2022-11-02 20:56:05,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:56:05,955 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:05,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 111 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:56:05,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-02 20:56:05,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-11-02 20:56:05,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 71 states have internal predecessors, (88), 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-02 20:56:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2022-11-02 20:56:05,964 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 25 [2022-11-02 20:56:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:05,964 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2022-11-02 20:56:05,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2022-11-02 20:56:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:56:05,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:05,966 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:06,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:56:06,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:06,179 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:06,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1425682976, now seen corresponding path program 1 times [2022-11-02 20:56:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:06,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038744950] [2022-11-02 20:56:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:06,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:06,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:06,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038744950] [2022-11-02 20:56:06,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038744950] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:06,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162993899] [2022-11-02 20:56:06,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:06,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:06,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:06,933 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:56:06,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:56:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:07,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-02 20:56:07,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:56:07,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:56:07,160 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:56:07,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-02 20:56:07,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:56:07,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:56:07,293 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:56:07,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-02 20:56:07,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-11-02 20:56:07,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 19 [2022-11-02 20:56:07,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:07,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-11-02 20:56:07,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:07,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2022-11-02 20:56:07,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:56:07,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:56:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:07,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:56:07,596 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-11-02 20:56:07,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_298) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2022-11-02 20:56:07,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_298) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 3)) is different from false [2022-11-02 20:56:07,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:07,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-02 20:56:07,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:07,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 78 [2022-11-02 20:56:07,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 16 [2022-11-02 20:56:07,683 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_297 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_297 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-02 20:56:07,718 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:07,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-02 20:56:07,727 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:07,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 35 [2022-11-02 20:56:07,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:56:07,747 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:56:07,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-02 20:56:07,760 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:56:07,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-11-02 20:56:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 20:56:07,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162993899] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:56:07,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:56:07,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 33 [2022-11-02 20:56:07,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120742086] [2022-11-02 20:56:07,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:56:07,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 20:56:07,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:07,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 20:56:07,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=741, Unknown=4, NotChecked=228, Total=1056 [2022-11-02 20:56:07,960 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:09,006 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-11-02 20:56:09,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:56:09,007 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 20:56:09,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:09,007 INFO L225 Difference]: With dead ends: 103 [2022-11-02 20:56:09,007 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 20:56:09,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=215, Invalid=1777, Unknown=4, NotChecked=356, Total=2352 [2022-11-02 20:56:09,009 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 78 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:09,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 320 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 420 Invalid, 0 Unknown, 177 Unchecked, 0.3s Time] [2022-11-02 20:56:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 20:56:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2022-11-02 20:56:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 71 states have internal predecessors, (87), 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-02 20:56:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2022-11-02 20:56:09,023 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2022-11-02 20:56:09,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:09,023 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2022-11-02 20:56:09,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-11-02 20:56:09,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:56:09,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:09,025 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] [2022-11-02 20:56:09,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:56:09,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:09,251 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:09,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash -154506453, now seen corresponding path program 2 times [2022-11-02 20:56:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:09,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888240854] [2022-11-02 20:56:09,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:09,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:56:09,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:09,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888240854] [2022-11-02 20:56:09,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888240854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:09,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:09,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:56:09,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585409756] [2022-11-02 20:56:09,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:09,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:09,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:09,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:09,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:09,296 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:09,313 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2022-11-02 20:56:09,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:09,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-02 20:56:09,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:09,314 INFO L225 Difference]: With dead ends: 126 [2022-11-02 20:56:09,315 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 20:56:09,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:09,317 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:09,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:56:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 20:56:09,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2022-11-02 20:56:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-11-02 20:56:09,334 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 32 [2022-11-02 20:56:09,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:09,335 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-11-02 20:56:09,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-11-02 20:56:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:56:09,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:09,336 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:09,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:56:09,337 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:09,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:09,337 INFO L85 PathProgramCache]: Analyzing trace with hash -972154903, now seen corresponding path program 1 times [2022-11-02 20:56:09,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:09,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451420805] [2022-11-02 20:56:09,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:09,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:10,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:10,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451420805] [2022-11-02 20:56:10,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451420805] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:10,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319026909] [2022-11-02 20:56:10,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:10,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:10,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:10,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:56:10,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:56:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:10,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-02 20:56:10,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:56:10,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:56:10,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:10,677 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:56:10,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-02 20:56:10,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:10,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:56:10,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:56:10,795 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:56:10,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-11-02 20:56:10,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:10,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:56:10,890 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:56:10,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-02 20:56:10,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 20:56:10,972 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:56:10,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-11-02 20:56:10,989 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-02 20:56:10,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-02 20:56:11,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-02 20:56:11,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:11,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-02 20:56:11,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:11,306 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:56:11,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 20:56:11,426 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-02 20:56:11,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2022-11-02 20:56:11,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:56:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:11,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:56:11,524 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|) 1)) is different from false [2022-11-02 20:56:11,529 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|))) is different from false [2022-11-02 20:56:11,539 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base|) (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4) v_ArrVal_459)) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset|) 1)) is different from false [2022-11-02 20:56:11,549 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_459)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_461)) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)) (= 3 |c_ULTIMATE.start_main_#t~mem8#1|)) is different from false [2022-11-02 20:56:11,558 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 .cse1 v_ArrVal_459)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1) v_ArrVal_461)) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)) (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) 3))) is different from false [2022-11-02 20:56:11,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 .cse2 v_ArrVal_459)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-11-02 20:56:11,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_50| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) is different from false [2022-11-02 20:56:11,703 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_50| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) is different from false [2022-11-02 20:56:11,751 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:11,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 111 [2022-11-02 20:56:11,774 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:11,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 820 treesize of output 813 [2022-11-02 20:56:11,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 399 treesize of output 391 [2022-11-02 20:56:11,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 790 treesize of output 774 [2022-11-02 20:56:14,556 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse38 (not .cse13)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse8 (or .cse38 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse45 (let ((.cse47 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse47 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse47 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse46 .cse4 v_ArrVal_459)) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (.cse14 (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse43 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (let ((.cse44 (store (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3))) (or (= (select (select (store (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse44 .cse4 v_ArrVal_459)) v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))))) (.cse22 (or .cse38 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse41 (let ((.cse42 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse42 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse42 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse40 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse39 (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse40 .cse4 v_ArrVal_459)))) (or (= (select (select (store .cse39 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse39 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (let ((.cse0 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_arrayElimCell_42 Int)) (or (forall ((v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse24 (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse26 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse26 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse25 .cse4 v_ArrVal_459)))) (or (= (select (select (store .cse23 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse23 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= 3 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|))) (or .cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse29 (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse30 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse30 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse28 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse27 (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse28 .cse4 v_ArrVal_459)))) (or (= (select (select (store .cse27 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse27 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse8 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_arrayElimCell_42 Int) (v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse32 (let ((.cse34 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse34 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse34 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int)) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse33 .cse4 v_ArrVal_459)))) (or (= (select (select (store .cse31 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse31 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse31 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= 3 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (or .cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse35 (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse37 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse37 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse36 .cse4 v_ArrVal_459)) v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse14 .cse22))) (and (or .cse0 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse2 (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse5 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse5 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 .cse4 v_ArrVal_459)))) (or (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse1 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= 3 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse8 (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse11 (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse12 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse12 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse10 .cse4 v_ArrVal_459)))) (or (= (select (select (store .cse9 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse9 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse13) (or .cse0 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) .cse14 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse16 (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse18 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse18 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int)) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse17 .cse4 v_ArrVal_459)))) (or (= (select (select (store .cse15 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse15 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store .cse15 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= 3 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (or .cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse19 (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse21 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse21 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse20 .cse4 v_ArrVal_459)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse22))))) is different from false [2022-11-02 20:56:40,246 WARN L234 SmtUtils]: Spent 20.85s on a formula simplification. DAG size of input: 145 DAG size of output: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:56:40,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:40,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 61 [2022-11-02 20:56:40,506 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:40,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 93 treesize of output 95 [2022-11-02 20:56:40,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 52 [2022-11-02 20:56:40,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 41 [2022-11-02 20:56:40,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-11-02 20:56:40,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:40,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:40,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2022-11-02 20:56:40,621 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:40,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 61 [2022-11-02 20:56:40,633 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:40,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 93 treesize of output 95 [2022-11-02 20:56:40,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-11-02 20:56:40,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-11-02 20:56:40,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:56:40,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:40,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2022-11-02 20:56:40,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:40,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 248 treesize of output 136 [2022-11-02 20:56:40,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:40,746 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:40,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 260 [2022-11-02 20:56:40,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 195 [2022-11-02 20:56:40,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 228 [2022-11-02 20:56:40,986 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:40,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 88 [2022-11-02 20:56:40,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:40,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:41,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:41,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 65 [2022-11-02 20:56:41,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-11-02 20:56:41,060 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:41,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 88 [2022-11-02 20:56:41,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:41,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2022-11-02 20:56:41,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-02 20:56:41,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:56:41,104 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:41,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 348 treesize of output 184 [2022-11-02 20:56:41,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:41,141 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:41,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 433 treesize of output 431 [2022-11-02 20:56:41,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 346 treesize of output 322 [2022-11-02 20:56:41,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 188 [2022-11-02 20:56:41,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:56:41,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-02 20:56:41,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2022-11-02 20:56:41,916 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:41,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 248 treesize of output 136 [2022-11-02 20:56:41,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:41,939 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:41,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 271 [2022-11-02 20:56:41,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 211 treesize of output 195 [2022-11-02 20:56:41,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 240 treesize of output 228 [2022-11-02 20:56:42,185 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:42,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 61 [2022-11-02 20:56:42,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:42,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2022-11-02 20:56:42,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-11-02 20:56:42,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-02 20:56:42,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:56:42,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:42,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 248 treesize of output 136 [2022-11-02 20:56:42,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:42,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:42,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 110 [2022-11-02 20:56:42,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 91 treesize of output 83 [2022-11-02 20:56:42,303 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:42,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 88 [2022-11-02 20:56:42,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:42,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:42,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 85 treesize of output 65 [2022-11-02 20:56:42,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 42 [2022-11-02 20:56:42,356 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:42,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 348 treesize of output 184 [2022-11-02 20:56:42,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:42,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:42,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 433 treesize of output 423 [2022-11-02 20:56:42,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 208 treesize of output 200 [2022-11-02 20:56:42,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 343 treesize of output 319 [2022-11-02 20:56:42,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-11-02 20:56:43,069 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:43,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 100 treesize of output 102 [2022-11-02 20:56:43,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 117 treesize of output 97 [2022-11-02 20:56:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-11-02 20:56:43,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319026909] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:56:43,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:56:43,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 45 [2022-11-02 20:56:43,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110395423] [2022-11-02 20:56:43,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:56:43,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-02 20:56:43,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:43,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-02 20:56:43,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1124, Unknown=21, NotChecked=684, Total=1980 [2022-11-02 20:56:43,785 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 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-02 20:56:45,720 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (not .cse15)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse10 (or .cse2 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse47 (let ((.cse49 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse49 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse49 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse48 .cse6 v_ArrVal_459)) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (.cse17 (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse45 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (let ((.cse46 (store (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3))) (or (= (select (select (store (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse46 .cse6 v_ArrVal_459)) v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))))) (.cse25 (or .cse2 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse43 (let ((.cse44 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse44 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse44 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse42 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse41 (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse42 .cse6 v_ArrVal_459)))) (or (= (select (select (store .cse41 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse41 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (let ((.cse1 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_arrayElimCell_42 Int)) (or (forall ((v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse27 (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse29 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse29 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse28 .cse6 v_ArrVal_459)))) (or (= (select (select (store .cse26 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse26 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= 3 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|))) (or .cse15 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse32 (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse33 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse33 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse30 (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse31 .cse6 v_ArrVal_459)))) (or (= (select (select (store .cse30 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse30 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse10 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_arrayElimCell_42 Int) (v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse35 (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse37 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse37 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int)) (let ((.cse34 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse36 .cse6 v_ArrVal_459)))) (or (= (select (select (store .cse34 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse34 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse34 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= 3 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (or .cse15 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse38 (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse40 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse40 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse39 .cse6 v_ArrVal_459)) v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse17 .cse25)) (.cse16 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or .cse0 .cse1) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) .cse2 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse4 (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse7 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse7 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse5 .cse6 v_ArrVal_459)))) (or (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse3 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= 3 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse10 .cse1 (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse13 (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse14 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse14 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse11 (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse12 .cse6 v_ArrVal_459)))) (or (= (select (select (store .cse11 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse11 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse15) (or .cse0 .cse16) (= (select .cse8 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) .cse17 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse19 (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse21 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse21 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int)) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse20 .cse6 v_ArrVal_459)))) (or (= (select (select (store .cse18 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse18 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store .cse18 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= 3 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or .cse15 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse22 (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse24 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse24 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse23 .cse6 v_ArrVal_459)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) .cse25 .cse16))))) is different from false [2022-11-02 20:56:47,316 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (not .cse15)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse10 (or .cse2 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse47 (let ((.cse49 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse49 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse49 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse48 .cse6 v_ArrVal_459)) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (.cse17 (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse45 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (let ((.cse46 (store (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3))) (or (= (select (select (store (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse46 .cse6 v_ArrVal_459)) v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))))) (.cse25 (or .cse2 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse43 (let ((.cse44 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse44 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse44 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse42 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse41 (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse42 .cse6 v_ArrVal_459)))) (or (= (select (select (store .cse41 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse41 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (let ((.cse1 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_arrayElimCell_42 Int)) (or (forall ((v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse27 (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse29 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse29 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse28 .cse6 v_ArrVal_459)))) (or (= (select (select (store .cse26 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse26 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= 3 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|))) (or .cse15 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse32 (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse33 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse33 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse30 (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse31 .cse6 v_ArrVal_459)))) (or (= (select (select (store .cse30 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse30 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse10 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_arrayElimCell_42 Int) (v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse35 (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse37 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse37 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int)) (let ((.cse34 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse36 .cse6 v_ArrVal_459)))) (or (= (select (select (store .cse34 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse34 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse34 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= 3 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (or .cse15 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse38 (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse40 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse40 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse39 .cse6 v_ArrVal_459)) v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse17 .cse25)) (.cse16 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or .cse0 .cse1) .cse2 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse4 (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse7 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse7 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse5 .cse6 v_ArrVal_459)))) (or (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse3 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= 3 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse10 .cse1 (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse13 (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse14 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse14 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse11 (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse12 .cse6 v_ArrVal_459)))) (or (= (select (select (store .cse11 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse11 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse15) (or .cse0 .cse16) (= (select .cse8 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) .cse17 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse19 (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse21 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse21 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int)) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse20 .cse6 v_ArrVal_459)))) (or (= (select (select (store .cse18 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse18 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store .cse18 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= 3 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (or .cse15 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse22 (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse8 .cse9 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse24 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse24 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse23 .cse6 v_ArrVal_459)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) .cse25 .cse16))))) is different from false [2022-11-02 20:56:47,410 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (and (forall ((v_ArrVal_457 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_50| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (not (= .cse4 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse4 |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-02 20:56:47,420 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (and (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_457 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_50|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 .cse3 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_50| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-02 20:56:49,425 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 .cse0 v_ArrVal_459)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0))) is different from false [2022-11-02 20:56:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:51,884 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-11-02 20:56:51,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:56:51,885 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 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-02 20:56:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:51,886 INFO L225 Difference]: With dead ends: 77 [2022-11-02 20:56:51,886 INFO L226 Difference]: Without dead ends: 75 [2022-11-02 20:56:51,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 14 IntricatePredicates, 5 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=223, Invalid=1787, Unknown=26, NotChecked=1386, Total=3422 [2022-11-02 20:56:51,888 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:51,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 154 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 161 Invalid, 0 Unknown, 319 Unchecked, 0.2s Time] [2022-11-02 20:56:51,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-02 20:56:51,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2022-11-02 20:56:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 66 states have internal predecessors, (77), 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-02 20:56:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2022-11-02 20:56:51,895 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 32 [2022-11-02 20:56:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:51,896 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2022-11-02 20:56:51,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 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-02 20:56:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-11-02 20:56:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:56:51,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:51,897 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-02 20:56:51,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:56:52,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:56:52,115 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:52,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:52,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2060333054, now seen corresponding path program 1 times [2022-11-02 20:56:52,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:52,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61620418] [2022-11-02 20:56:52,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:52,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:52,224 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:56:52,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:52,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61620418] [2022-11-02 20:56:52,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61620418] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:52,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488619277] [2022-11-02 20:56:52,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:52,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:52,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:52,226 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:56:52,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:56:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:52,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:56:52,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:56:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:56:52,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:56:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:56:52,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488619277] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:56:52,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:56:52,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2022-11-02 20:56:52,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955501594] [2022-11-02 20:56:52,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:56:52,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:56:52,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:52,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:56:52,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:56:52,477 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-02 20:56:52,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:52,645 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2022-11-02 20:56:52,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:56:52,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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) Word has length 34 [2022-11-02 20:56:52,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:52,646 INFO L225 Difference]: With dead ends: 90 [2022-11-02 20:56:52,646 INFO L226 Difference]: Without dead ends: 85 [2022-11-02 20:56:52,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:56:52,647 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 73 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:52,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 64 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:56:52,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-02 20:56:52,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2022-11-02 20:56:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 71 states have internal predecessors, (82), 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-02 20:56:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-11-02 20:56:52,654 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 34 [2022-11-02 20:56:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:52,655 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-11-02 20:56:52,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-02 20:56:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-11-02 20:56:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:56:52,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:52,657 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-02 20:56:52,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:56:52,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:52,860 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:52,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:52,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2062043076, now seen corresponding path program 1 times [2022-11-02 20:56:52,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:52,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111339696] [2022-11-02 20:56:52,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:52,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:56:54,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:54,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111339696] [2022-11-02 20:56:54,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111339696] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:54,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444672223] [2022-11-02 20:56:54,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:54,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:54,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:54,084 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:56:54,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:56:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:54,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-02 20:56:54,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:56:54,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:56:54,367 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:56:54,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-02 20:56:54,469 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-02 20:56:54,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:56:54,493 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-02 20:56:54,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:56:54,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:56:54,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:56:54,701 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:56:54,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:01,456 WARN L234 SmtUtils]: Spent 6.51s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:57:03,272 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~l1~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~t~0#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~t~0#1.offset| 4) |c_ULTIMATE.start_main_~l2~0#1.offset|)) |c_ULTIMATE.start_main_~l1~0#1.base|) .cse0) 0)) (forall ((|ULTIMATE.start_main_~t~0#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~t~0#1.offset| 4) |c_ULTIMATE.start_main_~l2~0#1.base|)) |c_ULTIMATE.start_main_~l1~0#1.base|) .cse0) 0)))) is different from false [2022-11-02 20:57:03,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-11-02 20:57:03,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-02 20:57:03,455 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 4 not checked. [2022-11-02 20:57:03,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444672223] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:57:03,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:57:03,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 9] total 26 [2022-11-02 20:57:03,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160663354] [2022-11-02 20:57:03,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:03,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 20:57:03,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:03,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 20:57:03,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=531, Unknown=1, NotChecked=46, Total=650 [2022-11-02 20:57:03,457 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:15,066 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-11-02 20:57:15,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 20:57:15,067 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 20:57:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:15,068 INFO L225 Difference]: With dead ends: 102 [2022-11-02 20:57:15,068 INFO L226 Difference]: Without dead ends: 95 [2022-11-02 20:57:15,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=154, Invalid=1181, Unknown=1, NotChecked=70, Total=1406 [2022-11-02 20:57:15,069 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 61 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:15,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 304 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 484 Invalid, 0 Unknown, 127 Unchecked, 0.5s Time] [2022-11-02 20:57:15,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-02 20:57:15,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 74. [2022-11-02 20:57:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 73 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-02 20:57:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-11-02 20:57:15,078 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 34 [2022-11-02 20:57:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:15,078 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-11-02 20:57:15,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-11-02 20:57:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:57:15,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:15,079 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:15,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:57:15,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:15,299 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:15,300 INFO L85 PathProgramCache]: Analyzing trace with hash 355505244, now seen corresponding path program 2 times [2022-11-02 20:57:15,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:15,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260977678] [2022-11-02 20:57:15,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:15,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:16,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:16,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260977678] [2022-11-02 20:57:16,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260977678] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:16,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951924874] [2022-11-02 20:57:16,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:57:16,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:57:16,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:16,839 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:57:16,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2af2e13-92a1-4ee9-ae41-a8d89ae145de/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:57:16,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:57:16,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:57:16,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-02 20:57:16,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:57:16,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:57:17,142 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:57:17,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:57:17,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:57:17,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-02 20:57:17,336 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:57:17,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-02 20:57:17,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:57:17,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:57:17,409 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-02 20:57:17,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-11-02 20:57:17,516 INFO L356 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-02 20:57:17,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 85 [2022-11-02 20:57:17,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 96 [2022-11-02 20:57:17,678 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:57:17,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 158 [2022-11-02 20:57:17,707 INFO L356 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-02 20:57:17,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 149 [2022-11-02 20:57:17,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 43 [2022-11-02 20:57:17,999 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:57:17,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 83 [2022-11-02 20:57:18,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 76 treesize of output 62 [2022-11-02 20:57:18,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2022-11-02 20:57:18,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 42 [2022-11-02 20:57:18,066 INFO L356 Elim1Store]: treesize reduction 36, result has 37.9 percent of original size [2022-11-02 20:57:18,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2022-11-02 20:57:18,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-02 20:57:18,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:57:18,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:57:18,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:57:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:18,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:18,253 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_789 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-11-02 20:57:18,260 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_789 (Array Int Int))) (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_789) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2022-11-02 20:57:18,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_788) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_789) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_786) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_787) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2022-11-02 20:57:18,284 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= 3 (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_788) .cse0 v_ArrVal_789) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_786) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_787) .cse0) .cse1)))))) is different from false [2022-11-02 20:57:18,302 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_788) .cse0 v_ArrVal_789) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_786) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_787) .cse0) .cse1)))) 3)) (= 3 |c_ULTIMATE.start_main_#t~mem7#1|)) is different from false [2022-11-02 20:57:18,331 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-02 20:57:18,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 119 [2022-11-02 20:57:18,388 INFO L356 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2022-11-02 20:57:18,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 903 treesize of output 909 [2022-11-02 20:57:18,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 760 treesize of output 632 [2022-11-02 20:57:18,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 348 treesize of output 284 [2022-11-02 20:57:20,643 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:20,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2022-11-02 20:57:20,652 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:20,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2022-11-02 20:57:20,677 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:20,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2022-11-02 20:57:20,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:20,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2022-11-02 20:57:20,709 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:20,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 116 [2022-11-02 20:57:20,718 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:20,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 134 [2022-11-02 20:57:20,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:20,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2022-11-02 20:57:20,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:20,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2022-11-02 20:57:20,783 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:20,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 109 [2022-11-02 20:57:20,794 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:20,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 118 [2022-11-02 20:57:20,822 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:20,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2022-11-02 20:57:20,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:20,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2022-11-02 20:57:21,695 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:21,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 79 [2022-11-02 20:57:21,706 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:21,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 69 [2022-11-02 20:57:21,722 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:21,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 689 treesize of output 490 [2022-11-02 20:57:21,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:57:22,212 INFO L356 Elim1Store]: treesize reduction 122, result has 72.1 percent of original size [2022-11-02 20:57:22,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 4800 treesize of output 4169 [2022-11-02 20:57:22,355 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:22,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2045 treesize of output 1557 [2022-11-02 20:57:22,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:22,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 875 treesize of output 787 [2022-11-02 20:57:22,494 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:22,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1334 treesize of output 1278 [2022-11-02 20:57:22,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:22,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1270 treesize of output 1246 [2022-11-02 20:57:22,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 109 treesize of output 77 [2022-11-02 20:57:29,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:29,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 156 [2022-11-02 20:57:29,540 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:29,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 136 [2022-11-02 20:57:29,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:29,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 711 treesize of output 524 [2022-11-02 20:57:29,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:57:30,137 INFO L356 Elim1Store]: treesize reduction 122, result has 72.1 percent of original size [2022-11-02 20:57:30,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 45350 treesize of output 36287 [2022-11-02 20:57:30,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36088 treesize of output 34712 [2022-11-02 20:57:30,874 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:30,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 34771 treesize of output 27079 [2022-11-02 20:57:31,134 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:31,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21513 treesize of output 20893 [2022-11-02 20:57:31,608 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:31,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26300 treesize of output 24788 [2022-11-02 20:57:31,899 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:31,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24764 treesize of output 24020 [2022-11-02 20:57:49,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:49,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 75 [2022-11-02 20:57:49,624 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:49,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 23024 treesize of output 18193 [2022-11-02 20:57:49,706 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:49,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18134 treesize of output 13124 [2022-11-02 20:57:49,787 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:49,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 83726 treesize of output 77707 [2022-11-02 20:57:50,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77692 treesize of output 69660 [2022-11-02 20:57:50,581 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:50,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69670 treesize of output 52050 [2022-11-02 20:57:50,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:50,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 51650 treesize of output 51344 [2022-11-02 20:57:51,618 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:51,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 51198 treesize of output 50650 [2022-11-02 20:57:52,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:52,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50198 treesize of output 49966