./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/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_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/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_bd833a73-9184-4e92-86bd-bd43696a795c/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 a135e953d64ed0fec81eb2a1e42f4031e3e387fc71d5a5cd2177772a202dc706 --- 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 21:07:00,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:07:00,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:07:00,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:07:00,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:07:00,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:07:00,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:07:00,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:07:00,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:07:00,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:07:00,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:07:00,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:07:00,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:07:00,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:07:00,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:07:00,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:07:00,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:07:00,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:07:00,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:07:00,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:07:00,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:07:00,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:07:00,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:07:00,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:07:00,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:07:00,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:07:00,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:07:00,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:07:00,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:07:00,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:07:00,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:07:00,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:07:00,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:07:00,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:07:00,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:07:00,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:07:00,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:07:00,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:07:00,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:07:00,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:07:00,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:07:00,450 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:07:00,494 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:07:00,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:07:00,495 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:07:00,495 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:07:00,496 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:07:00,496 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:07:00,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:07:00,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:07:00,497 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:07:00,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:07:00,498 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:07:00,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:07:00,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:07:00,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:07:00,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:07:00,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:07:00,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:07:00,500 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:07:00,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:07:00,500 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:07:00,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:07:00,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:07:00,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:07:00,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:07:00,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:07:00,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:07:00,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:07:00,502 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:07:00,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:07:00,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:07:00,503 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:07:00,503 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:07:00,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:07:00,504 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_bd833a73-9184-4e92-86bd-bd43696a795c/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_bd833a73-9184-4e92-86bd-bd43696a795c/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 -> a135e953d64ed0fec81eb2a1e42f4031e3e387fc71d5a5cd2177772a202dc706 [2022-11-02 21:07:00,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:07:00,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:07:00,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:07:00,846 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:07:00,847 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:07:00,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-properties/list-2.i [2022-11-02 21:07:00,927 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/data/68f5eb57f/1ccf2a0575614bac8f812709bd453ccf/FLAGd2ef6dae1 [2022-11-02 21:07:01,525 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:07:01,526 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/sv-benchmarks/c/list-properties/list-2.i [2022-11-02 21:07:01,538 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/data/68f5eb57f/1ccf2a0575614bac8f812709bd453ccf/FLAGd2ef6dae1 [2022-11-02 21:07:01,947 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/data/68f5eb57f/1ccf2a0575614bac8f812709bd453ccf [2022-11-02 21:07:01,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:07:01,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:07:01,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:07:01,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:07:01,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:07:01,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:07:01" (1/1) ... [2022-11-02 21:07:01,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa3b37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:01, skipping insertion in model container [2022-11-02 21:07:01,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:07:01" (1/1) ... [2022-11-02 21:07:01,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:07:02,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:07:02,448 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_bd833a73-9184-4e92-86bd-bd43696a795c/sv-benchmarks/c/list-properties/list-2.i[23408,23421] [2022-11-02 21:07:02,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:07:02,468 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:07:02,526 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_bd833a73-9184-4e92-86bd-bd43696a795c/sv-benchmarks/c/list-properties/list-2.i[23408,23421] [2022-11-02 21:07:02,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:07:02,553 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:07:02,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:02 WrapperNode [2022-11-02 21:07:02,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:07:02,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:07:02,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:07:02,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:07:02,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:02" (1/1) ... [2022-11-02 21:07:02,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:02" (1/1) ... [2022-11-02 21:07:02,624 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-11-02 21:07:02,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:07:02,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:07:02,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:07:02,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:07:02,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:02" (1/1) ... [2022-11-02 21:07:02,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:02" (1/1) ... [2022-11-02 21:07:02,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:02" (1/1) ... [2022-11-02 21:07:02,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:02" (1/1) ... [2022-11-02 21:07:02,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:02" (1/1) ... [2022-11-02 21:07:02,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:02" (1/1) ... [2022-11-02 21:07:02,671 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:02" (1/1) ... [2022-11-02 21:07:02,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:02" (1/1) ... [2022-11-02 21:07:02,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:07:02,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:07:02,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:07:02,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:07:02,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:02" (1/1) ... [2022-11-02 21:07:02,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:07:02,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:02,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:07:02,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:07:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-02 21:07:02,781 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-02 21:07:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:07:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:07:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:07:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:07:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:07:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:07:02,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:07:02,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:07:02,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:07:02,930 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:07:02,933 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:07:02,989 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-02 21:07:03,141 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:07:03,148 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:07:03,148 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 21:07:03,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:03 BoogieIcfgContainer [2022-11-02 21:07:03,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:07:03,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:07:03,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:07:03,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:07:03,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:07:01" (1/3) ... [2022-11-02 21:07:03,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1deaafa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:03, skipping insertion in model container [2022-11-02 21:07:03,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:02" (2/3) ... [2022-11-02 21:07:03,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1deaafa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:03, skipping insertion in model container [2022-11-02 21:07:03,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:03" (3/3) ... [2022-11-02 21:07:03,169 INFO L112 eAbstractionObserver]: Analyzing ICFG list-2.i [2022-11-02 21:07:03,190 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:07:03,190 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:07:03,265 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:07:03,273 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;@2c5eec3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:07:03,274 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:07:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:03,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 21:07:03,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:03,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:03,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:03,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:03,295 INFO L85 PathProgramCache]: Analyzing trace with hash 896526153, now seen corresponding path program 1 times [2022-11-02 21:07:03,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:03,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978326633] [2022-11-02 21:07:03,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:03,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:03,574 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 21:07:03,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:03,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978326633] [2022-11-02 21:07:03,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978326633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:03,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:03,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:03,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401726810] [2022-11-02 21:07:03,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:03,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:07:03,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:03,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:07:03,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:07:03,637 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 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 21:07:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:03,666 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-11-02 21:07:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:07:03,669 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 21:07:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:03,677 INFO L225 Difference]: With dead ends: 50 [2022-11-02 21:07:03,677 INFO L226 Difference]: Without dead ends: 21 [2022-11-02 21:07:03,681 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 21:07:03,686 INFO L413 NwaCegarLoop]: 36 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, 36 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 21:07:03,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:07:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-02 21:07:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-02 21:07:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 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 21:07:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-11-02 21:07:03,739 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2022-11-02 21:07:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:03,740 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-11-02 21:07:03,742 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 21:07:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-11-02 21:07:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 21:07:03,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:03,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:03,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:07:03,745 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:03,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:03,746 INFO L85 PathProgramCache]: Analyzing trace with hash 283143297, now seen corresponding path program 1 times [2022-11-02 21:07:03,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:03,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733621785] [2022-11-02 21:07:03,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:03,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,060 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 21:07:04,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:04,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733621785] [2022-11-02 21:07:04,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733621785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:04,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:04,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:07:04,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736859085] [2022-11-02 21:07:04,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:04,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:07:04,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:04,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:07:04,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:07:04,065 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:04,224 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-11-02 21:07:04,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:07:04,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 21:07:04,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:04,227 INFO L225 Difference]: With dead ends: 46 [2022-11-02 21:07:04,227 INFO L226 Difference]: Without dead ends: 42 [2022-11-02 21:07:04,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:04,229 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:04,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 55 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:07:04,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-02 21:07:04,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-11-02 21:07:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 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 21:07:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-11-02 21:07:04,254 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2022-11-02 21:07:04,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:04,254 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-11-02 21:07:04,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-11-02 21:07:04,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:07:04,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:04,257 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:04,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:07:04,257 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:04,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1566445212, now seen corresponding path program 1 times [2022-11-02 21:07:04,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:04,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793265453] [2022-11-02 21:07:04,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:04,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,464 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 21:07:04,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:04,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793265453] [2022-11-02 21:07:04,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793265453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:04,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:04,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:07:04,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259745490] [2022-11-02 21:07:04,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:04,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:07:04,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:04,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:07:04,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:07:04,468 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 21:07:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:04,593 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-11-02 21:07:04,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:07:04,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-02 21:07:04,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:04,599 INFO L225 Difference]: With dead ends: 48 [2022-11-02 21:07:04,599 INFO L226 Difference]: Without dead ends: 40 [2022-11-02 21:07:04,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:04,601 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:04,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 60 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:07:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-02 21:07:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-11-02 21:07:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-11-02 21:07:04,612 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2022-11-02 21:07:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:04,613 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-11-02 21:07:04,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 21:07:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-11-02 21:07:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:07:04,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:04,614 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:04,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:07:04,615 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:04,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1703819108, now seen corresponding path program 1 times [2022-11-02 21:07:04,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:04,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031795265] [2022-11-02 21:07:04,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:04,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,825 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 21:07:04,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:04,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031795265] [2022-11-02 21:07:04,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031795265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:04,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:04,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:07:04,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473164913] [2022-11-02 21:07:04,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:04,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:07:04,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:04,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:07:04,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:07:04,828 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 21:07:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:04,944 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-11-02 21:07:04,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:07:04,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-02 21:07:04,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:04,945 INFO L225 Difference]: With dead ends: 48 [2022-11-02 21:07:04,945 INFO L226 Difference]: Without dead ends: 37 [2022-11-02 21:07:04,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:04,947 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:04,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:07:04,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-02 21:07:04,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2022-11-02 21:07:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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 21:07:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-02 21:07:04,953 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2022-11-02 21:07:04,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:04,953 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-02 21:07:04,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 21:07:04,953 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-02 21:07:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 21:07:04,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:04,954 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:04,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:07:04,955 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:04,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:04,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1538293272, now seen corresponding path program 1 times [2022-11-02 21:07:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:04,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433659008] [2022-11-02 21:07:04,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:04,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:05,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:05,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433659008] [2022-11-02 21:07:05,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433659008] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:05,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216835757] [2022-11-02 21:07:05,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:05,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:05,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:05,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:05,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:07:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:05,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 21:07:05,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:05,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 21:07:05,797 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 21:07:05,829 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:05,830 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 21:07:05,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:05,947 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 21:07:06,030 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 21:07:06,059 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 21:07:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:06,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:06,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_84 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_84) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 21:07:06,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_84 (Array Int Int)) (v_ArrVal_82 Int)) (= 2 (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_82)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_84) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 21:07:06,130 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:06,131 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 21:07:06,144 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:06,145 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 21:07:06,153 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 21:07:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:07:06,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216835757] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:06,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:06,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-11-02 21:07:06,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651793446] [2022-11-02 21:07:06,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:06,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 21:07:06,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 21:07:06,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2022-11-02 21:07:06,335 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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 21:07:06,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:06,575 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-11-02 21:07:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:07:06,576 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 21:07:06,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:06,577 INFO L225 Difference]: With dead ends: 47 [2022-11-02 21:07:06,578 INFO L226 Difference]: Without dead ends: 41 [2022-11-02 21:07:06,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=268, Unknown=2, NotChecked=70, Total=420 [2022-11-02 21:07:06,583 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:06,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 101 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 78 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2022-11-02 21:07:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-02 21:07:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2022-11-02 21:07:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-11-02 21:07:06,599 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 20 [2022-11-02 21:07:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:06,599 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-11-02 21:07:06,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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 21:07:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-11-02 21:07:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 21:07:06,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:06,601 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:06,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:06,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:06,826 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:06,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:06,831 INFO L85 PathProgramCache]: Analyzing trace with hash -674891608, now seen corresponding path program 1 times [2022-11-02 21:07:06,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:06,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102194678] [2022-11-02 21:07:06,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:06,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:07,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:07,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102194678] [2022-11-02 21:07:07,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102194678] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:07,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219532709] [2022-11-02 21:07:07,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:07,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:07,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:07,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:07,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:07:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:07,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 21:07:07,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:07,247 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 21:07:07,357 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:07,357 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 21:07:07,370 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 21:07:07,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:07,423 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 21:07:07,490 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 21:07:07,525 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 21:07:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:07,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:07,547 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_136 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 21:07:07,575 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_135 Int) (v_ArrVal_136 (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_135)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 21:07:07,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:07,600 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 21:07:07,611 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:07,611 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 21:07:07,618 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 21:07:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:07:07,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219532709] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:07,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:07,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-11-02 21:07:07,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852891955] [2022-11-02 21:07:07,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:07,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 21:07:07,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:07,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 21:07:07,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2022-11-02 21:07:07,730 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:08,004 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-11-02 21:07:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:07:08,005 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 21:07:08,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:08,006 INFO L225 Difference]: With dead ends: 68 [2022-11-02 21:07:08,006 INFO L226 Difference]: Without dead ends: 64 [2022-11-02 21:07:08,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=257, Unknown=2, NotChecked=70, Total=420 [2022-11-02 21:07:08,008 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:08,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 142 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 114 Invalid, 0 Unknown, 92 Unchecked, 0.1s Time] [2022-11-02 21:07:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-02 21:07:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 43. [2022-11-02 21:07:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 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 21:07:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-11-02 21:07:08,016 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 20 [2022-11-02 21:07:08,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:08,016 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-11-02 21:07:08,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-11-02 21:07:08,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 21:07:08,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:08,018 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] [2022-11-02 21:07:08,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:08,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:08,235 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:08,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:08,235 INFO L85 PathProgramCache]: Analyzing trace with hash 242294851, now seen corresponding path program 1 times [2022-11-02 21:07:08,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:08,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319643310] [2022-11-02 21:07:08,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:08,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:08,735 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 21:07:08,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:08,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319643310] [2022-11-02 21:07:08,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319643310] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:08,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925202105] [2022-11-02 21:07:08,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:08,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:08,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:08,741 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:08,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:07:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:08,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-02 21:07:08,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:08,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:07:08,938 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:08,939 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 21:07:08,981 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 21:07:08,989 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 21:07:09,063 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:07:09,063 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 21:07:09,072 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 21:07:09,077 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 21:07:09,122 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 39 treesize of output 21 [2022-11-02 21:07:09,129 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 23 treesize of output 11 [2022-11-02 21:07:09,148 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 21:07:09,151 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 21:07:09,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:09,196 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 79 treesize of output 57 [2022-11-02 21:07:09,208 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_189 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_186 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_186) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-02 21:07:09,254 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:09,254 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 21:07:09,264 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:09,265 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 21:07:09,309 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 21:07:09,317 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:07:09,323 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 21:07:09,496 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 21:07:09,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925202105] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:09,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:09,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-02 21:07:09,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744494548] [2022-11-02 21:07:09,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:09,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 21:07:09,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:09,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 21:07:09,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2022-11-02 21:07:09,500 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 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 21:07:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:09,753 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-11-02 21:07:09,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:07:09,754 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 21:07:09,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:09,755 INFO L225 Difference]: With dead ends: 55 [2022-11-02 21:07:09,755 INFO L226 Difference]: Without dead ends: 51 [2022-11-02 21:07:09,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=315, Unknown=1, NotChecked=36, Total=420 [2022-11-02 21:07:09,757 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:09,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 131 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 147 Invalid, 0 Unknown, 60 Unchecked, 0.2s Time] [2022-11-02 21:07:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-02 21:07:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-11-02 21:07:09,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 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 21:07:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-11-02 21:07:09,771 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 22 [2022-11-02 21:07:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:09,771 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-11-02 21:07:09,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 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 21:07:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-11-02 21:07:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 21:07:09,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:09,776 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:09,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:09,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-02 21:07:09,991 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:09,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:09,991 INFO L85 PathProgramCache]: Analyzing trace with hash 965794270, now seen corresponding path program 1 times [2022-11-02 21:07:09,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:09,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050460947] [2022-11-02 21:07:09,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:09,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:10,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:10,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050460947] [2022-11-02 21:07:10,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050460947] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:10,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455067134] [2022-11-02 21:07:10,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:10,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:10,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:10,458 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:10,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:07:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:10,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-02 21:07:10,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:10,553 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 21:07:10,616 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:10,616 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 21:07:10,651 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 21:07:10,657 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 21:07:10,707 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:07:10,707 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 21:07:10,714 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 21:07:10,717 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 32 treesize of output 34 [2022-11-02 21:07:10,751 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 39 treesize of output 21 [2022-11-02 21:07:10,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-02 21:07:10,768 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 21:07:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:10,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:10,828 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 52 treesize of output 30 [2022-11-02 21:07:10,836 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_240 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_240) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_242 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_242) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-02 21:07:10,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:10,858 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 21:07:10,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:10,867 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 38 treesize of output 31 [2022-11-02 21:07:10,872 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 11 treesize of output 7 [2022-11-02 21:07:10,891 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:07:10,891 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 22 treesize of output 1 [2022-11-02 21:07:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:07:11,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455067134] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:11,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:11,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-02 21:07:11,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260152362] [2022-11-02 21:07:11,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:11,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 21:07:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:11,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 21:07:11,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2022-11-02 21:07:11,005 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:11,429 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-11-02 21:07:11,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:07:11,430 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 21:07:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:11,430 INFO L225 Difference]: With dead ends: 65 [2022-11-02 21:07:11,431 INFO L226 Difference]: Without dead ends: 55 [2022-11-02 21:07:11,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=566, Unknown=1, NotChecked=50, Total=756 [2022-11-02 21:07:11,432 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:11,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 168 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 228 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2022-11-02 21:07:11,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-02 21:07:11,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2022-11-02 21:07:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-11-02 21:07:11,443 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 24 [2022-11-02 21:07:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:11,443 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-11-02 21:07:11,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-11-02 21:07:11,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 21:07:11,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:11,445 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] [2022-11-02 21:07:11,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:11,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:11,655 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:11,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:11,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1990497246, now seen corresponding path program 2 times [2022-11-02 21:07:11,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:11,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221585035] [2022-11-02 21:07:11,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:11,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:12,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:12,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221585035] [2022-11-02 21:07:12,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221585035] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:12,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583844338] [2022-11-02 21:07:12,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:07:12,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:12,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:12,051 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:12,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:07:12,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:07:12,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:12,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-02 21:07:12,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:12,154 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 21:07:12,232 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:12,233 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 21:07:12,272 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 21:07:12,279 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 21:07:12,365 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:07:12,365 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 21:07:12,370 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 21:07:12,375 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 32 treesize of output 34 [2022-11-02 21:07:12,413 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 39 treesize of output 21 [2022-11-02 21:07:12,418 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 23 treesize of output 11 [2022-11-02 21:07:12,427 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 21:07:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:12,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:12,494 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 52 treesize of output 30 [2022-11-02 21:07:12,502 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_293 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |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.base|)))) is different from false [2022-11-02 21:07:12,527 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:12,528 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 21:07:12,536 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:12,537 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 38 treesize of output 31 [2022-11-02 21:07:12,542 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 11 treesize of output 7 [2022-11-02 21:07:12,564 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:07:12,565 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 22 treesize of output 1 [2022-11-02 21:07:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:07:12,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583844338] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:12,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:12,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-02 21:07:12,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212665905] [2022-11-02 21:07:12,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:12,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 21:07:12,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:12,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 21:07:12,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2022-11-02 21:07:12,692 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:13,076 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-11-02 21:07:13,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:07:13,077 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 21:07:13,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:13,078 INFO L225 Difference]: With dead ends: 58 [2022-11-02 21:07:13,078 INFO L226 Difference]: Without dead ends: 45 [2022-11-02 21:07:13,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=566, Unknown=1, NotChecked=50, Total=756 [2022-11-02 21:07:13,079 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 102 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:13,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 96 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 128 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2022-11-02 21:07:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-02 21:07:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2022-11-02 21:07:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-11-02 21:07:13,084 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 24 [2022-11-02 21:07:13,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:13,085 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-11-02 21:07:13,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-11-02 21:07:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 21:07:13,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:13,086 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:13,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:13,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:13,287 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:13,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash 366447567, now seen corresponding path program 2 times [2022-11-02 21:07:13,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:13,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170615112] [2022-11-02 21:07:13,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:13,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:13,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:13,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170615112] [2022-11-02 21:07:13,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170615112] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:13,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415437063] [2022-11-02 21:07:13,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:07:13,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:13,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:13,827 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:13,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 21:07:13,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:07:13,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:13,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-02 21:07:13,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:13,937 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 21:07:13,988 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:13,988 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 21:07:13,995 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 21:07:14,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:14,023 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 21:07:14,039 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 21:07:14,090 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 21:07:14,138 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-02 21:07:14,139 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 19 treesize of output 22 [2022-11-02 21:07:14,267 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 21:07:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:14,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:15,422 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (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)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse0) (= 3 .cse0)))) is different from false [2022-11-02 21:07:15,458 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= 2 .cse0)))) is different from false [2022-11-02 21:07:15,478 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) is different from false [2022-11-02 21:07:15,517 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_373 Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (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_373)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2022-11-02 21:07:15,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:15,547 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 95 treesize of output 61 [2022-11-02 21:07:15,569 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:15,570 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 547 treesize of output 537 [2022-11-02 21:07:15,590 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 535 treesize of output 503 [2022-11-02 21:07:15,653 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 21:07:15,733 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:15,733 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 281 treesize of output 271 [2022-11-02 21:07:16,098 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 275 treesize of output 259 [2022-11-02 21:07:17,087 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:17,087 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 434 treesize of output 412 [2022-11-02 21:07:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-02 21:07:18,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415437063] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:18,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:18,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-11-02 21:07:18,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463787721] [2022-11-02 21:07:18,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:18,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 21:07:18,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:18,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 21:07:18,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=286, Unknown=4, NotChecked=148, Total=506 [2022-11-02 21:07:18,310 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 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 21:07:18,411 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 21:07:18,419 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 21:07:18,423 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_60| Int) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_376))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_60|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= 2 .cse0)))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 21:07:19,862 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (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)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse0) (= 3 .cse0)))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 21:07:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:19,961 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-11-02 21:07:19,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:07:19,962 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 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 24 [2022-11-02 21:07:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:19,962 INFO L225 Difference]: With dead ends: 77 [2022-11-02 21:07:19,962 INFO L226 Difference]: Without dead ends: 73 [2022-11-02 21:07:19,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=100, Invalid=386, Unknown=8, NotChecked=376, Total=870 [2022-11-02 21:07:19,963 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 101 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:19,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 109 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 124 Invalid, 0 Unknown, 212 Unchecked, 0.1s Time] [2022-11-02 21:07:19,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-02 21:07:19,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2022-11-02 21:07:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 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 21:07:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-11-02 21:07:19,970 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 24 [2022-11-02 21:07:19,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:19,971 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-11-02 21:07:19,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 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 21:07:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-11-02 21:07:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 21:07:19,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:19,972 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] [2022-11-02 21:07:20,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:20,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 21:07:20,172 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash 666149519, now seen corresponding path program 1 times [2022-11-02 21:07:20,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:20,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022121596] [2022-11-02 21:07:20,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:20,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:20,621 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 21:07:20,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:20,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022121596] [2022-11-02 21:07:20,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022121596] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:20,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574026019] [2022-11-02 21:07:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:20,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:20,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:20,623 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:20,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 21:07:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:20,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-02 21:07:20,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:20,733 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 21:07:20,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, 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 21:07:20,776 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:20,776 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 21:07:20,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:20,799 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 21:07:20,828 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 21:07:20,874 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 21:07:20,925 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-02 21:07:20,931 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 19 treesize of output 22 [2022-11-02 21:07:21,077 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 21:07:21,079 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 21:07:21,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:23,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (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)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-11-02 21:07:23,145 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-11-02 21:07:23,164 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 1)))) is different from false [2022-11-02 21:07:23,200 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_457 Int)) (let ((.cse0 (select (select (let ((.cse1 (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_457)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-11-02 21:07:23,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:23,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2022-11-02 21:07:23,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:23,245 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 547 treesize of output 537 [2022-11-02 21:07:23,259 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 535 treesize of output 503 [2022-11-02 21:07:23,311 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 21:07:23,542 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:23,543 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 281 treesize of output 271 [2022-11-02 21:07:23,810 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 275 treesize of output 259 [2022-11-02 21:07:24,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:24,066 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 371 treesize of output 357 [2022-11-02 21:07:24,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 21:07:24,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574026019] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:24,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:24,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-11-02 21:07:24,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160129226] [2022-11-02 21:07:24,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:24,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 21:07:24,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:24,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 21:07:24,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=286, Unknown=4, NotChecked=148, Total=506 [2022-11-02 21:07:24,559 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 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 21:07:24,599 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 .cse0) (= .cse0 1)))) (= (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)) is different from false [2022-11-02 21:07:24,617 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_68| Int) (v_ArrVal_463 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_463))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_68|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |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)) is different from false [2022-11-02 21:07:25,986 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (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)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) (= (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) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) is different from false [2022-11-02 21:07:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:26,031 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-11-02 21:07:26,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:07:26,032 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 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 24 [2022-11-02 21:07:26,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:26,032 INFO L225 Difference]: With dead ends: 57 [2022-11-02 21:07:26,033 INFO L226 Difference]: Without dead ends: 53 [2022-11-02 21:07:26,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=82, Invalid=319, Unknown=7, NotChecked=294, Total=702 [2022-11-02 21:07:26,034 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:26,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 135 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 192 Unchecked, 0.1s Time] [2022-11-02 21:07:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-02 21:07:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2022-11-02 21:07:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 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 21:07:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-11-02 21:07:26,041 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 24 [2022-11-02 21:07:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:26,041 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-11-02 21:07:26,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 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 21:07:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-11-02 21:07:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 21:07:26,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:26,042 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:26,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:26,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:26,271 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:26,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:26,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1529551183, now seen corresponding path program 2 times [2022-11-02 21:07:26,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:26,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738809815] [2022-11-02 21:07:26,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:26,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:26,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:26,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738809815] [2022-11-02 21:07:26,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738809815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:26,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340340639] [2022-11-02 21:07:26,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:07:26,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:26,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:26,683 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:26,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 21:07:26,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:07:26,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:26,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-02 21:07:26,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:26,816 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 21:07:26,900 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:26,900 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 21:07:26,915 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 21:07:26,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:26,972 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 21:07:27,014 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 21:07:27,068 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 21:07:27,148 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-02 21:07:27,149 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 19 treesize of output 22 [2022-11-02 21:07:27,336 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 21:07:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:27,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:29,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (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)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-11-02 21:07:29,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-11-02 21:07:29,497 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-11-02 21:07:29,524 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_544 Int) (v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (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_544)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-11-02 21:07:29,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:29,558 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 95 treesize of output 61 [2022-11-02 21:07:29,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:29,580 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 547 treesize of output 537 [2022-11-02 21:07:29,609 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 535 treesize of output 503 [2022-11-02 21:07:29,674 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 21:07:29,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:29,902 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 285 treesize of output 275 [2022-11-02 21:07:30,134 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 275 treesize of output 259 [2022-11-02 21:07:30,979 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:30,980 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 412 treesize of output 394 [2022-11-02 21:07:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-02 21:07:32,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340340639] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:32,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:32,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 29 [2022-11-02 21:07:32,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650888762] [2022-11-02 21:07:32,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:32,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-02 21:07:32,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:32,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-02 21:07:32,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=517, Unknown=4, NotChecked=196, Total=812 [2022-11-02 21:07:32,024 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 states have internal predecessors, (67), 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 21:07:32,151 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |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)) is different from false [2022-11-02 21:07:32,158 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |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)) is different from false [2022-11-02 21:07:32,172 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |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) (forall ((v_ArrVal_547 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_76| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_547))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_76|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0))))) is different from false [2022-11-02 21:07:33,631 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (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)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |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) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) is different from false [2022-11-02 21:07:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:33,771 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2022-11-02 21:07:33,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:07:33,775 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 21:07:33,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:33,775 INFO L225 Difference]: With dead ends: 89 [2022-11-02 21:07:33,776 INFO L226 Difference]: Without dead ends: 85 [2022-11-02 21:07:33,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=130, Invalid=650, Unknown=8, NotChecked=472, Total=1260 [2022-11-02 21:07:33,777 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:33,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 189 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 188 Invalid, 0 Unknown, 199 Unchecked, 0.2s Time] [2022-11-02 21:07:33,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-02 21:07:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2022-11-02 21:07:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-11-02 21:07:33,784 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 24 [2022-11-02 21:07:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:33,785 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-11-02 21:07:33,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 states have internal predecessors, (67), 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 21:07:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-11-02 21:07:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:07:33,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:33,786 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:33,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-02 21:07:34,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 21:07:34,006 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:34,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:34,007 INFO L85 PathProgramCache]: Analyzing trace with hash 17470058, now seen corresponding path program 1 times [2022-11-02 21:07:34,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:34,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822056248] [2022-11-02 21:07:34,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:34,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:34,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:34,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822056248] [2022-11-02 21:07:34,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822056248] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:34,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886954221] [2022-11-02 21:07:34,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:34,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:34,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:34,424 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:34,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 21:07:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:34,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-02 21:07:34,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:34,544 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 21:07:34,588 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 21:07:34,601 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:34,601 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 21:07:34,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:34,625 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 21:07:34,640 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 21:07:34,677 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 21:07:34,722 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-02 21:07:34,722 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 19 treesize of output 22 [2022-11-02 21:07:34,787 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:34,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 31 treesize of output 23 [2022-11-02 21:07:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:34,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:36,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (not (= (select (select (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)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-11-02 21:07:36,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_85| Int) (v_ArrVal_632 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_632))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-11-02 21:07:36,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_85| Int) (v_ArrVal_632 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_632))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-11-02 21:07:36,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_85| Int) (v_ArrVal_626 Int) (v_ArrVal_632 (Array Int Int))) (not (= (select (select (let ((.cse0 (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_626)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_632))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2022-11-02 21:07:36,906 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:36,906 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 48 treesize of output 41 [2022-11-02 21:07:36,926 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:36,926 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 295 treesize of output 301 [2022-11-02 21:07:36,936 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 270 treesize of output 254 [2022-11-02 21:07:37,001 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 21:07:37,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:37,059 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 44 treesize of output 44 [2022-11-02 21:07:37,076 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 59 treesize of output 55 [2022-11-02 21:07:37,081 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-11-02 21:07:37,101 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 71 [2022-11-02 21:07:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-02 21:07:37,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886954221] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:37,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:37,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2022-11-02 21:07:37,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176931692] [2022-11-02 21:07:37,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:37,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-02 21:07:37,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:37,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 21:07:37,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=322, Unknown=4, NotChecked=156, Total=552 [2022-11-02 21:07:37,215 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 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 21:07:37,318 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_85| Int) (v_ArrVal_632 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_632))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 21:07:37,325 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_85| Int) (v_ArrVal_632 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_632))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 21:07:37,329 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_85| Int) (v_ArrVal_632 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_632))) (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_85|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 21:07:38,766 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (not (= (select (select (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)) |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) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-02 21:07:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:38,893 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-11-02 21:07:38,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:07:38,893 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 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 21:07:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:38,894 INFO L225 Difference]: With dead ends: 84 [2022-11-02 21:07:38,894 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 21:07:38,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=122, Invalid=502, Unknown=8, NotChecked=424, Total=1056 [2022-11-02 21:07:38,895 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 54 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:38,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 199 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 162 Invalid, 0 Unknown, 211 Unchecked, 0.1s Time] [2022-11-02 21:07:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 21:07:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2022-11-02 21:07:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-11-02 21:07:38,904 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 26 [2022-11-02 21:07:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:38,904 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-11-02 21:07:38,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 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 21:07:38,905 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-11-02 21:07:38,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:07:38,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:38,905 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:38,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:39,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 21:07:39,106 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:39,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:39,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1042173034, now seen corresponding path program 3 times [2022-11-02 21:07:39,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:39,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554634627] [2022-11-02 21:07:39,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:39,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:39,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:39,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554634627] [2022-11-02 21:07:39,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554634627] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:39,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771595102] [2022-11-02 21:07:39,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 21:07:39,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:39,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:39,754 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:39,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 21:07:39,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 21:07:39,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:07:39,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-02 21:07:39,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:39,894 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 21:07:39,941 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:39,941 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 21:07:39,988 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 11 treesize of output 7 [2022-11-02 21:07:40,000 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 21:07:40,073 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:07:40,073 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 21 treesize of output 25 [2022-11-02 21:07:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:07:40,090 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 21:07:40,108 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:07:40,108 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 22 treesize of output 22 [2022-11-02 21:07:40,198 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:07:40,198 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 101 treesize of output 92 [2022-11-02 21:07:40,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:40,206 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 41 treesize of output 36 [2022-11-02 21:07:40,210 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 65 treesize of output 51 [2022-11-02 21:07:40,305 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:07:40,305 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 56 treesize of output 56 [2022-11-02 21:07:40,323 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-02 21:07:40,323 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 27 treesize of output 32 [2022-11-02 21:07:40,353 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-02 21:07:40,353 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 36 treesize of output 47 [2022-11-02 21:07:40,363 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 15 treesize of output 11 [2022-11-02 21:07:40,385 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 59 treesize of output 47 [2022-11-02 21:07:40,729 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 109 treesize of output 85 [2022-11-02 21:07:40,750 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-02 21:07:40,750 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 89 treesize of output 77 [2022-11-02 21:07:41,033 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:41,034 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 22 treesize of output 14 [2022-11-02 21:07:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:41,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:43,282 WARN L833 $PredicateComparison]: unable to prove that (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)))) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= .cse0 2) (= .cse0 3)))) (not (= 2 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-11-02 21:07:43,338 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_720 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (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|) .cse3 v_ArrVal_717)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_95| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_95|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (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|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= 3 .cse0) (= 2 .cse0) (not (= 2 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) is different from false [2022-11-02 21:07:43,408 INFO L356 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2022-11-02 21:07:43,409 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 4279 treesize of output 4035 [2022-11-02 21:07:43,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:43,492 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 2154 treesize of output 1887 [2022-11-02 21:07:45,553 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 21:07:46,199 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse3 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse40 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse40)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (.cse5 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse39 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))))) (.cse4 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse1))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse0 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) .cse3 (or .cse4 (and .cse3 .cse5)) .cse5 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse6 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse6)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse7 .cse1)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse8 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse8 0) (= .cse8 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse9 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse10 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (or .cse4 (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse11 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse12)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse13 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse13 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse14)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse15 0) (= .cse15 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_ArrVal_723 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse17 0)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse18)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (let ((.cse21 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse37 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse37 0)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))))) (.cse27 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse36)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse19 0) (= .cse19 .cse1)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse20 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse21 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse22)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse23 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse23 .cse1)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse24)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse25 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse25 0) (= .cse25 .cse1)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse26 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse26 .cse1)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) .cse27 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_ArrVal_723 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse28 0)))))) (or .cse4 (and .cse21 .cse27)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse30 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse32)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse33 .cse1)))))) (or .cse4 (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse34 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse35 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse35)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse38 0))))))))) is different from false [2022-11-02 21:07:47,410 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:47,411 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 51 treesize of output 41 [2022-11-02 21:07:47,424 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:47,424 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 25 treesize of output 26 [2022-11-02 21:07:47,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:47,453 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 269 treesize of output 250 [2022-11-02 21:07:47,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:47,473 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 243 treesize of output 231 [2022-11-02 21:07:47,487 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 219 treesize of output 187 [2022-11-02 21:07:47,510 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:47,510 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 70 treesize of output 69 [2022-11-02 21:07:47,525 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 54 treesize of output 46 [2022-11-02 21:07:47,536 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 24 treesize of output 20 [2022-11-02 21:07:47,970 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:47,970 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 53 treesize of output 43 [2022-11-02 21:07:47,981 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:47,981 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 51 treesize of output 41 [2022-11-02 21:07:48,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:48,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 130 [2022-11-02 21:07:48,012 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 115 treesize of output 99 [2022-11-02 21:07:48,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:48,035 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 269 treesize of output 250 [2022-11-02 21:07:48,053 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 235 treesize of output 203 [2022-11-02 21:07:48,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:07:48,068 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 21:07:48,085 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 203 treesize of output 187 [2022-11-02 21:07:48,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:48,401 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 53 treesize of output 43 [2022-11-02 21:07:48,410 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:48,410 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 51 treesize of output 41 [2022-11-02 21:07:48,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:07:48,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:48,428 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 65 treesize of output 58 [2022-11-02 21:07:48,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:07:48,438 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:48,439 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 61 treesize of output 54 [2022-11-02 21:07:48,444 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 23 treesize of output 15 [2022-11-02 21:07:48,479 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:48,479 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 33 treesize of output 29 [2022-11-02 21:07:48,500 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:07:48,501 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 53 treesize of output 1 [2022-11-02 21:07:48,512 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:07:48,512 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 78 treesize of output 1 [2022-11-02 21:07:48,522 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:48,522 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 76 treesize of output 56 [2022-11-02 21:07:48,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:07:48,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:48,538 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 86 treesize of output 73 [2022-11-02 21:07:48,545 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 34 treesize of output 22 [2022-11-02 21:07:48,573 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 21:07:48,579 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 21:07:48,590 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:07:48,591 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 51 treesize of output 1 [2022-11-02 21:07:48,601 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:07:48,602 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 78 treesize of output 1 [2022-11-02 21:07:48,613 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:07:48,614 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 51 treesize of output 1 [2022-11-02 21:07:48,624 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:07:48,625 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 25 treesize of output 1 [2022-11-02 21:07:48,637 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:07:48,637 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 51 treesize of output 1 [2022-11-02 21:07:48,647 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:07:48,647 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 76 treesize of output 1 [2022-11-02 21:07:48,654 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-11-02 21:07:48,665 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:07:48,665 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 25 treesize of output 1 [2022-11-02 21:07:48,676 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:07:48,677 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 53 treesize of output 1 [2022-11-02 21:07:48,687 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 21:07:48,688 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 51 treesize of output 1 [2022-11-02 21:07:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-02 21:07:48,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771595102] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:48,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:48,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 33 [2022-11-02 21:07:48,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344786372] [2022-11-02 21:07:48,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:48,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 21:07:48,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:48,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 21:07:48,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=779, Unknown=3, NotChecked=174, Total=1056 [2022-11-02 21:07:48,980 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 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 21:07:49,237 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse3 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse43)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (.cse5 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse42 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse42 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))))) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse4 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse1)) (.cse19 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse0 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) .cse3 (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (or .cse4 (and .cse3 .cse5)) .cse5 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse6 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse6)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse7 .cse1)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse8 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse8 0) (= .cse8 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))) (not (= .cse9 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse10 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= .cse11 0) (= .cse9 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (or .cse4 (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse13 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse14 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse14)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse15 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse15 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse16)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse17 0) (= .cse17 .cse1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse19 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_ArrVal_723 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse20 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse20 0)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse21)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (let ((.cse24 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse40 0)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))))) (.cse30 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse39)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse22 0) (= .cse22 .cse1)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse23 |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse24 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse25 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse25)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse26 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse26 .cse1)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse27)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse28 0) (= .cse28 .cse1)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse29 .cse1)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) .cse30 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_arrayElimArr_13 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (forall ((v_ArrVal_723 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse31 0)))))) (or .cse4 (and .cse24 .cse30)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse33 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse34 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (not (= (select v_arrayElimArr_13 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 0))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse35 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse35)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse36 .cse1)))))) (or .cse4 (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse37 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse38 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| .cse38)))) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)))))))) .cse19) (= .cse11 |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_13 .cse1) 0)) (= .cse41 0))))))))) is different from false [2022-11-02 21:07:49,301 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= 2 (select .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_720 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse4 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse2 .cse6 v_ArrVal_717)))) (store .cse7 |v_ULTIMATE.start_main_~p~0#1.base_95| (store (select .cse7 |v_ULTIMATE.start_main_~p~0#1.base_95|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse3 (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_720) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (select (select (store (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|) .cse6 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))) (or (= 3 .cse3) (= 2 .cse3) (not (= 2 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (= |c_ULTIMATE.start_main_~t~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-11-02 21:07:51,405 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse3 (select |c_#memory_int| .cse1))) (and (= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse2 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2) (and (not (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|)) (not .cse2) (= (select .cse3 .cse4) 2)))) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse4 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse6 (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)))) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse5 (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse6 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) (or (= .cse5 2) (= .cse5 3)))) (not (= 2 (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select .cse3 0))))) is different from false [2022-11-02 21:07:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:52,181 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-11-02 21:07:52,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 21:07:52,184 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 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 21:07:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:52,185 INFO L225 Difference]: With dead ends: 72 [2022-11-02 21:07:52,185 INFO L226 Difference]: Without dead ends: 66 [2022-11-02 21:07:52,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=182, Invalid=1476, Unknown=6, NotChecked=498, Total=2162 [2022-11-02 21:07:52,187 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:52,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 189 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 170 Invalid, 0 Unknown, 147 Unchecked, 0.2s Time] [2022-11-02 21:07:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-02 21:07:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2022-11-02 21:07:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 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 21:07:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-11-02 21:07:52,206 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 26 [2022-11-02 21:07:52,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:52,206 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-11-02 21:07:52,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 33 states have internal predecessors, (67), 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 21:07:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-11-02 21:07:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:07:52,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:52,208 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, 1] [2022-11-02 21:07:52,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:52,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 21:07:52,435 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:52,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:52,435 INFO L85 PathProgramCache]: Analyzing trace with hash 268237098, now seen corresponding path program 1 times [2022-11-02 21:07:52,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:52,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256214274] [2022-11-02 21:07:52,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:52,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:52,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:07:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:07:52,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:07:52,542 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:07:52,544 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 21:07:52,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:07:52,553 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:52,558 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:07:52,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:07:52 BoogieIcfgContainer [2022-11-02 21:07:52,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:07:52,598 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:07:52,598 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:07:52,598 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:07:52,599 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:03" (3/4) ... [2022-11-02 21:07:52,601 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 21:07:52,669 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:07:52,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:07:52,669 INFO L158 Benchmark]: Toolchain (without parser) took 50716.56ms. Allocated memory was 104.9MB in the beginning and 299.9MB in the end (delta: 195.0MB). Free memory was 71.9MB in the beginning and 180.2MB in the end (delta: -108.2MB). Peak memory consumption was 87.1MB. Max. memory is 16.1GB. [2022-11-02 21:07:52,670 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 104.9MB. Free memory was 60.8MB in the beginning and 60.7MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:07:52,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.76ms. Allocated memory is still 104.9MB. Free memory was 71.7MB in the beginning and 73.1MB in the end (delta: -1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 21:07:52,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.95ms. Allocated memory is still 104.9MB. Free memory was 73.1MB in the beginning and 71.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:07:52,673 INFO L158 Benchmark]: Boogie Preprocessor took 61.00ms. Allocated memory is still 104.9MB. Free memory was 71.0MB in the beginning and 69.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:07:52,673 INFO L158 Benchmark]: RCFGBuilder took 464.07ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 56.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 21:07:52,673 INFO L158 Benchmark]: TraceAbstraction took 49439.38ms. Allocated memory was 104.9MB in the beginning and 299.9MB in the end (delta: 195.0MB). Free memory was 55.6MB in the beginning and 182.3MB in the end (delta: -126.7MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2022-11-02 21:07:52,674 INFO L158 Benchmark]: Witness Printer took 71.48ms. Allocated memory is still 299.9MB. Free memory was 182.3MB in the beginning and 180.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:07:52,685 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 104.9MB. Free memory was 60.8MB in the beginning and 60.7MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 595.76ms. Allocated memory is still 104.9MB. Free memory was 71.7MB in the beginning and 73.1MB in the end (delta: -1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.95ms. Allocated memory is still 104.9MB. Free memory was 73.1MB in the beginning and 71.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.00ms. Allocated memory is still 104.9MB. Free memory was 71.0MB in the beginning and 69.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 464.07ms. Allocated memory is still 104.9MB. Free memory was 69.4MB in the beginning and 56.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 49439.38ms. Allocated memory was 104.9MB in the beginning and 299.9MB in the end (delta: 195.0MB). Free memory was 55.6MB in the beginning and 182.3MB in the end (delta: -126.7MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. * Witness Printer took 71.48ms. Allocated memory is still 299.9MB. Free memory was 182.3MB in the beginning and 180.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 557]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={-1:0}] [L534] List t; [L535] List p = a; VAL [a={-1:0}, p={-1:0}] [L536] COND TRUE __VERIFIER_nondet_int() [L537] p->h = 1 [L538] t = (List) malloc(sizeof(struct node)) [L539] COND FALSE !(t == 0) VAL [a={-1:0}, p={-1:0}, t={-2:0}] [L540] p->n = t [L541] EXPR p->n [L541] p = p->n [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND TRUE __VERIFIER_nondet_int() [L544] p->h = 2 [L545] t = (List) malloc(sizeof(struct node)) [L546] COND FALSE !(t == 0) VAL [a={-1:0}, p={-2:0}, t={-3:0}] [L547] p->n = t [L548] EXPR p->n [L548] p = p->n [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 [L551] p = a VAL [a={-1:0}, p={-1:0}, t={-3:0}] [L552] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=1, t={-3:0}] [L552] COND FALSE !(p->h == 2) [L554] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=1, t={-3:0}] [L554] COND TRUE p->h == 1 [L555] EXPR p->n [L555] p = p->n [L554] EXPR p->h VAL [a={-1:0}, p={-2:0}, p->h=2, t={-3:0}] [L554] COND FALSE !(p->h == 1) [L556] EXPR p->h VAL [a={-1:0}, p={-2:0}, p->h=2, t={-3:0}] [L556] COND TRUE p->h != 3 [L557] reach_error() VAL [a={-1:0}, p={-2:0}, t={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.3s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 559 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 559 mSDsluCounter, 1658 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1317 IncrementalHoareTripleChecker+Unchecked, 1404 mSDsCounter, 223 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1568 IncrementalHoareTripleChecker+Invalid, 3108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 223 mSolverCounterUnsat, 254 mSDtfsCounter, 1568 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 645 GetRequests, 353 SyntacticMatches, 5 SemanticMatches, 287 ConstructedPredicates, 44 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 22.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=14, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 203 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 33.1s InterpolantComputationTime, 558 NumberOfCodeBlocks, 558 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 732 ConstructedInterpolants, 124 QuantifiedInterpolants, 14937 SizeOfPredicates, 111 NumberOfNonLiveVariables, 1436 ConjunctsInSsa, 432 ConjunctsInUnsatCore, 34 InterpolantComputations, 4 PerfectInterpolantSequences, 28/190 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-02 21:07:52,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd833a73-9184-4e92-86bd-bd43696a795c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE