./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/alternating_list-1.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_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/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_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/alternating_list-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/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_c2a370df-1e60-4767-aad5-4ed8aa9e3133/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 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:20:17,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:20:17,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:20:17,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:20:17,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:20:17,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:20:17,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:20:17,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:20:17,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:20:17,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:20:17,605 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:20:17,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:20:17,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:20:17,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:20:17,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:20:17,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:20:17,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:20:17,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:20:17,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:20:17,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:20:17,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:20:17,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:20:17,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:20:17,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:20:17,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:20:17,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:20:17,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:20:17,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:20:17,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:20:17,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:20:17,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:20:17,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:20:17,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:20:17,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:20:17,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:20:17,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:20:17,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:20:17,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:20:17,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:20:17,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:20:17,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:20:17,676 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:20:17,730 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:20:17,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:20:17,735 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:20:17,735 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:20:17,736 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:20:17,736 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:20:17,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:20:17,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:20:17,738 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:20:17,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:20:17,740 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:20:17,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:20:17,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:20:17,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:20:17,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:20:17,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:20:17,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:20:17,742 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:20:17,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:20:17,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:20:17,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:20:17,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:20:17,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:20:17,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:20:17,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:20:17,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:20:17,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:20:17,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:20:17,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:20:17,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:20:17,747 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:20:17,748 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:20:17,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:20:17,748 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_c2a370df-1e60-4767-aad5-4ed8aa9e3133/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_c2a370df-1e60-4767-aad5-4ed8aa9e3133/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 -> 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 [2022-11-02 20:20:18,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:20:18,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:20:18,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:20:18,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:20:18,141 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:20:18,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-properties/alternating_list-1.i [2022-11-02 20:20:18,236 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/data/78743bd50/18323de8176c493988e7cba425083de7/FLAG2c97186a6 [2022-11-02 20:20:18,877 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:20:18,878 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/sv-benchmarks/c/list-properties/alternating_list-1.i [2022-11-02 20:20:18,892 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/data/78743bd50/18323de8176c493988e7cba425083de7/FLAG2c97186a6 [2022-11-02 20:20:19,129 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/data/78743bd50/18323de8176c493988e7cba425083de7 [2022-11-02 20:20:19,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:20:19,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:20:19,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:20:19,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:20:19,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:20:19,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:20:19" (1/1) ... [2022-11-02 20:20:19,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1321f61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:19, skipping insertion in model container [2022-11-02 20:20:19,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:20:19" (1/1) ... [2022-11-02 20:20:19,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:20:19,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:20:19,753 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_c2a370df-1e60-4767-aad5-4ed8aa9e3133/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2022-11-02 20:20:19,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:20:19,770 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:20:19,842 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_c2a370df-1e60-4767-aad5-4ed8aa9e3133/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2022-11-02 20:20:19,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:20:19,880 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:20:19,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:19 WrapperNode [2022-11-02 20:20:19,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:20:19,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:20:19,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:20:19,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:20:19,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:19" (1/1) ... [2022-11-02 20:20:19,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:19" (1/1) ... [2022-11-02 20:20:19,968 INFO L138 Inliner]: procedures = 124, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 85 [2022-11-02 20:20:19,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:20:19,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:20:19,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:20:19,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:20:19,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:19" (1/1) ... [2022-11-02 20:20:19,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:19" (1/1) ... [2022-11-02 20:20:19,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:19" (1/1) ... [2022-11-02 20:20:19,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:19" (1/1) ... [2022-11-02 20:20:20,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:19" (1/1) ... [2022-11-02 20:20:20,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:19" (1/1) ... [2022-11-02 20:20:20,013 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:19" (1/1) ... [2022-11-02 20:20:20,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:19" (1/1) ... [2022-11-02 20:20:20,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:20:20,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:20:20,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:20:20,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:20:20,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:19" (1/1) ... [2022-11-02 20:20:20,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:20:20,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:20,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:20:20,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:20:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-02 20:20:20,125 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-02 20:20:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:20:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:20:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:20:20,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:20:20,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:20:20,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:20:20,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:20:20,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:20:20,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:20:20,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:20:20,288 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:20:20,291 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:20:20,351 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-02 20:20:20,576 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:20:20,584 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:20:20,584 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:20:20,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:20:20 BoogieIcfgContainer [2022-11-02 20:20:20,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:20:20,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:20:20,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:20:20,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:20:20,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:20:19" (1/3) ... [2022-11-02 20:20:20,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb7cf35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:20:20, skipping insertion in model container [2022-11-02 20:20:20,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:19" (2/3) ... [2022-11-02 20:20:20,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb7cf35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:20:20, skipping insertion in model container [2022-11-02 20:20:20,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:20:20" (3/3) ... [2022-11-02 20:20:20,607 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2022-11-02 20:20:20,636 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:20:20,637 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:20:20,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:20:20,759 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;@59b4a817, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:20:20,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:20:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 26 states have (on average 1.5) internal successors, (39), 28 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:20,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:20,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:20,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:20,791 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:20,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:20,802 INFO L85 PathProgramCache]: Analyzing trace with hash 930969484, now seen corresponding path program 1 times [2022-11-02 20:20:20,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:20,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578754579] [2022-11-02 20:20:20,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:20,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:21,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:21,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578754579] [2022-11-02 20:20:21,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578754579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:21,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:21,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:20:21,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318723818] [2022-11-02 20:20:21,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:21,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:20:21,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:21,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:20:21,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:20:21,180 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.5) internal successors, (39), 28 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:21,209 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-11-02 20:20:21,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:20:21,212 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-02 20:20:21,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:21,220 INFO L225 Difference]: With dead ends: 46 [2022-11-02 20:20:21,220 INFO L226 Difference]: Without dead ends: 19 [2022-11-02 20:20:21,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:20:21,229 INFO L413 NwaCegarLoop]: 37 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, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:21,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:20:21,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-02 20:20:21,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-02 20:20:21,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-11-02 20:20:21,272 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2022-11-02 20:20:21,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:21,273 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-11-02 20:20:21,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:21,275 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-11-02 20:20:21,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:20:21,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:21,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:21,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:20:21,278 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:21,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:21,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1797355599, now seen corresponding path program 1 times [2022-11-02 20:20:21,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:21,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579013146] [2022-11-02 20:20:21,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:21,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:21,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:21,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579013146] [2022-11-02 20:20:21,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579013146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:21,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:21,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:20:21,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761964322] [2022-11-02 20:20:21,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:21,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:20:21,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:21,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:20:21,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:20:21,491 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:21,522 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-11-02 20:20:21,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:20:21,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 20:20:21,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:21,524 INFO L225 Difference]: With dead ends: 47 [2022-11-02 20:20:21,525 INFO L226 Difference]: Without dead ends: 32 [2022-11-02 20:20:21,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:20:21,527 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:21,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:20:21,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-02 20:20:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-11-02 20:20:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-11-02 20:20:21,535 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 12 [2022-11-02 20:20:21,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:21,536 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-11-02 20:20:21,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-11-02 20:20:21,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:20:21,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:21,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:21,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:20:21,538 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:21,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:21,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1797348655, now seen corresponding path program 1 times [2022-11-02 20:20:21,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:21,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093247622] [2022-11-02 20:20:21,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:21,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:21,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:21,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093247622] [2022-11-02 20:20:21,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093247622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:21,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:21,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:20:21,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076617223] [2022-11-02 20:20:21,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:21,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:20:21,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:21,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:20:21,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:20:21,913 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:22,008 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-11-02 20:20:22,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:20:22,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 20:20:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:22,010 INFO L225 Difference]: With dead ends: 57 [2022-11-02 20:20:22,010 INFO L226 Difference]: Without dead ends: 42 [2022-11-02 20:20:22,011 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 20:20:22,012 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:22,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 56 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:20:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-02 20:20:22,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-11-02 20:20:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-11-02 20:20:22,021 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 12 [2022-11-02 20:20:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:22,022 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-11-02 20:20:22,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-11-02 20:20:22,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:20:22,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:22,026 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 20:20:22,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:20:22,026 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:22,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:22,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1890563654, now seen corresponding path program 1 times [2022-11-02 20:20:22,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:22,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564311215] [2022-11-02 20:20:22,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:22,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:22,753 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 20:20:22,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:22,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564311215] [2022-11-02 20:20:22,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564311215] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:20:22,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046988908] [2022-11-02 20:20:22,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:22,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:22,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:22,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:20:22,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:20:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:22,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 20:20:22,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:23,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:20:23,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:20:23,284 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:20:23,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:20:23,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:23,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:20:23,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:20:23,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:20:23,504 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 20:20:23,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:23,531 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_76 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_76) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 20:20:23,573 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_76 (Array Int Int)) (v_ArrVal_75 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_75)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_76) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-02 20:20:23,698 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:23,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-02 20:20:23,720 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:23,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-02 20:20:23,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:20:23,994 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 20:20:23,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046988908] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:20:23,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:20:23,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-02 20:20:23,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116020331] [2022-11-02 20:20:23,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:20:23,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 20:20:23,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:23,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:20:23,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=250, Unknown=2, NotChecked=66, Total=380 [2022-11-02 20:20:23,999 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:28,704 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-11-02 20:20:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:20:28,705 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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 18 [2022-11-02 20:20:28,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:28,706 INFO L225 Difference]: With dead ends: 62 [2022-11-02 20:20:28,707 INFO L226 Difference]: Without dead ends: 60 [2022-11-02 20:20:28,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=171, Invalid=700, Unknown=7, NotChecked=114, Total=992 [2022-11-02 20:20:28,709 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:28,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 117 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 113 Invalid, 0 Unknown, 109 Unchecked, 0.2s Time] [2022-11-02 20:20:28,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-02 20:20:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2022-11-02 20:20:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-11-02 20:20:28,721 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 18 [2022-11-02 20:20:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:28,721 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-11-02 20:20:28,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:28,722 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-11-02 20:20:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:20:28,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:28,723 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] [2022-11-02 20:20:28,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:28,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:28,939 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:28,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:28,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1672328945, now seen corresponding path program 1 times [2022-11-02 20:20:28,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:28,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231897166] [2022-11-02 20:20:28,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:28,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:29,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:29,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231897166] [2022-11-02 20:20:29,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231897166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:20:29,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131206212] [2022-11-02 20:20:29,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:29,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:29,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:29,710 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:20:29,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:20:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 20:20:29,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:29,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:20:29,938 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:20:29,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 20:20:30,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:20:30,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:20:30,105 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:20:30,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-02 20:20:30,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-11-02 20:20:30,125 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 20:20:30,209 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 20:20:30,216 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 20:20:30,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:20:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:30,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:30,282 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 20:20:30,294 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_126 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_128 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-02 20:20:30,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:30,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-02 20:20:30,339 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:30,340 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 20:20:30,346 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 20:20:30,381 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:20:30,382 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 20:20:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:20:30,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131206212] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:20:30,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:20:30,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-11-02 20:20:30,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887616823] [2022-11-02 20:20:30,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:20:30,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 20:20:30,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:30,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:20:30,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=262, Unknown=1, NotChecked=32, Total=342 [2022-11-02 20:20:30,555 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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 20:20:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:31,108 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2022-11-02 20:20:31,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:20:31,109 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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 23 [2022-11-02 20:20:31,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:31,110 INFO L225 Difference]: With dead ends: 75 [2022-11-02 20:20:31,110 INFO L226 Difference]: Without dead ends: 55 [2022-11-02 20:20:31,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=592, Unknown=1, NotChecked=50, Total=756 [2022-11-02 20:20:31,112 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:31,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 213 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 230 Invalid, 0 Unknown, 58 Unchecked, 0.2s Time] [2022-11-02 20:20:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-02 20:20:31,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-11-02 20:20:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2022-11-02 20:20:31,121 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 23 [2022-11-02 20:20:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:31,122 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2022-11-02 20:20:31,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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 20:20:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-11-02 20:20:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:20:31,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:31,124 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:31,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:31,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:31,347 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:31,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:31,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1588811868, now seen corresponding path program 2 times [2022-11-02 20:20:31,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:31,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545407871] [2022-11-02 20:20:31,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:20:31,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:31,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545407871] [2022-11-02 20:20:31,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545407871] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:31,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:31,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:20:31,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745475299] [2022-11-02 20:20:31,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:31,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:20:31,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:31,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:20:31,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:20:31,406 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:31,429 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-11-02 20:20:31,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:20:31,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:20:31,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:31,431 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:20:31,431 INFO L226 Difference]: Without dead ends: 51 [2022-11-02 20:20:31,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:20:31,432 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:31,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 43 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:20:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-02 20:20:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2022-11-02 20:20:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-11-02 20:20:31,440 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 29 [2022-11-02 20:20:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:31,441 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-11-02 20:20:31,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-11-02 20:20:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:20:31,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:31,443 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:31,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:20:31,443 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:31,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1117807526, now seen corresponding path program 1 times [2022-11-02 20:20:31,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:31,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211567690] [2022-11-02 20:20:31,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:32,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:32,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211567690] [2022-11-02 20:20:32,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211567690] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:20:32,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604209620] [2022-11-02 20:20:32,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:32,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:32,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:32,646 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:20:32,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:20:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:32,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-02 20:20:32,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:32,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:20:32,953 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:20:32,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:20:33,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:20:33,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:20:33,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:20:33,163 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:20:33,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-11-02 20:20:33,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:33,178 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 25 treesize of output 25 [2022-11-02 20:20:33,362 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:20:33,363 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 125 treesize of output 116 [2022-11-02 20:20:33,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:33,378 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 51 treesize of output 44 [2022-11-02 20:20:33,386 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 81 treesize of output 59 [2022-11-02 20:20:33,544 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:20:33,544 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 72 treesize of output 72 [2022-11-02 20:20:33,605 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-02 20:20:33,606 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 65 treesize of output 70 [2022-11-02 20:20:33,645 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-02 20:20:33,645 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 29 treesize of output 34 [2022-11-02 20:20:33,668 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 11 [2022-11-02 20:20:33,718 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 69 treesize of output 57 [2022-11-02 20:20:33,822 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 41 treesize of output 33 [2022-11-02 20:20:33,852 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 53 treesize of output 45 [2022-11-02 20:20:34,556 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 89 treesize of output 69 [2022-11-02 20:20:34,565 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:20:34,565 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 42 [2022-11-02 20:20:34,881 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-02 20:20:34,881 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 29 treesize of output 25 [2022-11-02 20:20:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:34,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:37,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_252) |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_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= .cse1 3) (= .cse1 2))))))) is different from false [2022-11-02 20:20:37,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (v_ArrVal_249 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (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_249)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_39|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |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_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 2 .cse1) (= 3 .cse1)))))) is different from false [2022-11-02 20:20:37,390 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (v_ArrVal_249 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_249)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_39|) 0 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_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |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 0)) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= .cse0 3) (= .cse0 2) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))) is different from false [2022-11-02 20:20:37,429 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:37,430 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 2036 treesize of output 1936 [2022-11-02 20:20:37,480 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:37,481 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 1300 treesize of output 1143 [2022-11-02 20:20:39,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-02 20:20:39,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-02 20:20:40,028 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |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|) .cse0) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse22 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse5))) (let ((.cse1 (not .cse22)) (.cse2 (not .cse0)) (.cse15 (and .cse22 .cse0)) (.cse3 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse21 |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse4 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 0))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse9 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse5) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse20 0) (= .cse20 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (.cse10 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |v_ULTIMATE.start_main_~p~0#1.base_39|)))))) (and (or .cse1 .cse2 (and .cse3 .cse4 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= (select v_arrayElimArr_4 .cse5) 0)) (= .cse6 0) (not (= .cse6 .cse5))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= (select v_arrayElimArr_4 .cse5) 0)) (= .cse8 0) (= .cse8 .cse5)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse5) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5)))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse9 .cse10)) (or (let ((.cse11 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |v_ULTIMATE.start_main_~p~0#1.base_39|))))) (.cse12 (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (not (= (select v_arrayElimArr_4 .cse5) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse19 0) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (.cse13 (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse18 |v_ULTIMATE.start_main_~p~0#1.base_39|))))) (.cse14 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse5) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 0))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (and (or (and .cse11 .cse12 .cse13 .cse14) .cse15) (or .cse1 .cse2 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse16 |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse5) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5)))))) .cse11 .cse12 .cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= (select v_arrayElimArr_4 .cse5) 0)) (= .cse17 0) (= .cse17 .cse5)))))) .cse14 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse5) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5)))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) |c_ULTIMATE.start_main_~p~0#1.base|))))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (or .cse15 (and .cse3 .cse4 .cse9 .cse10)))))))) is different from false [2022-11-02 20:20:42,183 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:42,184 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 20:20:42,195 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:42,196 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 20:20:42,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:42,207 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 61 treesize of output 55 [2022-11-02 20:20:42,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:42,219 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 34 treesize of output 28 [2022-11-02 20:20:42,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:42,229 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 35 treesize of output 23 [2022-11-02 20:20:42,237 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 20:20:42,244 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 12 treesize of output 8 [2022-11-02 20:20:42,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-11-02 20:20:42,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:42,286 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 20:20:42,301 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:42,302 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 20:20:42,323 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:42,326 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 20:20:42,350 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:42,350 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 20:20:42,366 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 20:20:42,376 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 20:20:42,387 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 20:20:42,404 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:42,405 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 33 [2022-11-02 20:20:42,586 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:42,586 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 20:20:42,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:42,598 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 20:20:42,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:42,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:42,609 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 18 treesize of output 12 [2022-11-02 20:20:42,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:42,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:42,617 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 18 treesize of output 12 [2022-11-02 20:20:42,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:20:42,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:42,628 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 16 treesize of output 8 [2022-11-02 20:20:42,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:42,648 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 20:20:42,660 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:42,660 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 20:20:42,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:42,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:42,683 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 36 treesize of output 35 [2022-11-02 20:20:42,695 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:42,696 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 20 treesize of output 20 [2022-11-02 20:20:42,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:42,719 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:42,720 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 36 treesize of output 35 [2022-11-02 20:20:42,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:20:42,767 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:20:42,767 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 20:20:42,777 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:20:42,777 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 20:20:42,788 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:20:42,788 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 20:20:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-02 20:20:43,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604209620] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:20:43,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:20:43,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 40 [2022-11-02 20:20:43,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392559608] [2022-11-02 20:20:43,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:20:43,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-02 20:20:43,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:43,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-02 20:20:43,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1109, Unknown=4, NotChecked=284, Total=1560 [2022-11-02 20:20:43,345 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:43,551 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (not .cse3)) (.cse2 (select .cse27 .cse10)) (.cse23 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse1 (select .cse0 .cse10))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (= (select .cse0 4) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3) (let ((.cse8 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse26 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse8))) (let ((.cse4 (not .cse26)) (.cse18 (and .cse26 .cse3)) (.cse6 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (= .cse25 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse25 |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse7 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) 0))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse12 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (= .cse24 0) (= .cse24 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (.cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |v_ULTIMATE.start_main_~p~0#1.base_39|)))))) (and (or .cse4 .cse5 (and .cse6 .cse7 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (= .cse9 0) (not (= .cse9 .cse8))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (= .cse11 0) (= .cse11 .cse8)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse8)))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse12 .cse13)) (or (let ((.cse14 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |v_ULTIMATE.start_main_~p~0#1.base_39|))))) (.cse15 (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (= .cse22 0) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (.cse16 (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse21 |v_ULTIMATE.start_main_~p~0#1.base_39|))))) (.cse17 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) 0))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (and (or (and .cse14 .cse15 .cse16 .cse17) .cse18) (or .cse4 .cse5 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= .cse19 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse19 |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse8)))))) .cse14 .cse15 .cse16 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (= .cse20 0) (= .cse20 .cse8)))))) .cse17 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse8)))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.base|))))))))) .cse23) (or .cse18 (and .cse6 .cse7 .cse12 .cse13))))))) .cse5 (= .cse2 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 0)) .cse23 (= (select .cse27 4) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-02 20:20:43,579 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (not .cse3)) (.cse2 (select .cse27 .cse10)) (.cse23 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse1 (select .cse0 .cse10))) (and (= (select .cse0 4) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3) (let ((.cse8 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse26 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse8))) (let ((.cse4 (not .cse26)) (.cse18 (and .cse26 .cse3)) (.cse6 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (= .cse25 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse25 |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse7 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) 0))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)))) (.cse12 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (= .cse24 0) (= .cse24 |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (.cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.offset|))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |v_ULTIMATE.start_main_~p~0#1.base_39|)))))) (and (or .cse4 .cse5 (and .cse6 .cse7 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (= .cse9 0) (not (= .cse9 .cse8))))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (= .cse11 0) (= .cse11 .cse8)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse8)))) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse12 .cse13)) (or (let ((.cse14 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.offset|))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |v_ULTIMATE.start_main_~p~0#1.base_39|))))) (.cse15 (forall ((v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (= .cse22 0) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (.cse16 (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse21 |v_ULTIMATE.start_main_~p~0#1.base_39|))))) (.cse17 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) 0))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (and (or (and .cse14 .cse15 .cse16 .cse17) .cse18) (or .cse4 .cse5 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= .cse19 |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse19 |v_ULTIMATE.start_main_~p~0#1.base_39|)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse8)))))) .cse14 .cse15 .cse16 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (= .cse20 0) (= .cse20 .cse8)))))) .cse17 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse8) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse8)))) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) |c_ULTIMATE.start_main_~p~0#1.base|))))))))) .cse23) (or .cse18 (and .cse6 .cse7 .cse12 .cse13))))))) .cse5 (= .cse2 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 0)) .cse23 (= (select .cse27 4) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-02 20:20:43,600 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse8 (select .cse9 .cse2)) (.cse7 (select .cse6 .cse2))) (and (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (v_ArrVal_249 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 .cse5 .cse3 v_ArrVal_249)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_39|) 0 3))))) (let ((.cse0 (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |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 0)) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (or (= .cse0 3) (= .cse0 2) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))) (= (select .cse6 4) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse7 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse8 |c_ULTIMATE.start_main_~p~0#1.offset|) (= 2 (select .cse5 |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse8 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse9 4) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse7 |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-02 20:20:43,613 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (select .cse9 .cse6)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse1 (select .cse0 .cse6))) (and (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= (select .cse0 4) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|) (= 2 (select .cse3 |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|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse2 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_248 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (v_ArrVal_249 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse4 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse7 v_ArrVal_249)))) (store .cse8 |v_ULTIMATE.start_main_~p~0#1.base_39| (store (select .cse8 |v_ULTIMATE.start_main_~p~0#1.base_39|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse5 (select (select .cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (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|) .cse7 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)))) (or (not (= (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 2 .cse5) (= 3 .cse5)))))) (= (select .cse9 4) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-02 20:20:45,621 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (select .cse6 .cse9)) (.cse1 (select .cse5 .cse9))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) (+ .cse1 4)))) (and (= (select (select |c_#memory_int| .cse0) .cse1) 2) (= .cse2 0) (let ((.cse3 (= |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|) .cse3) (let ((.cse4 (select .cse6 4))) (and (not (= .cse4 |c_ULTIMATE.start_main_~p~0#1.base|)) (not .cse3) (= (select (select |c_#memory_int| .cse4) (select .cse5 4)) 2))))) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse2) (= .cse1 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse7 (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 (not (= (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse8 (select (select .cse7 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))) (or (= .cse8 3) (= .cse8 2))))))))))) is different from false [2022-11-02 20:20:46,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:46,380 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-11-02 20:20:46,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:20:46,382 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 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 29 [2022-11-02 20:20:46,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:46,382 INFO L225 Difference]: With dead ends: 55 [2022-11-02 20:20:46,382 INFO L226 Difference]: Without dead ends: 53 [2022-11-02 20:20:46,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=240, Invalid=1593, Unknown=9, NotChecked=810, Total=2652 [2022-11-02 20:20:46,385 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:46,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 130 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 94 Unchecked, 0.1s Time] [2022-11-02 20:20:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-02 20:20:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-02 20:20:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-11-02 20:20:46,396 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 29 [2022-11-02 20:20:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:46,397 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-11-02 20:20:46,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-11-02 20:20:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:20:46,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:46,399 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:46,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:46,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:46,623 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:46,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:46,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1947572814, now seen corresponding path program 1 times [2022-11-02 20:20:46,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:46,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66822336] [2022-11-02 20:20:46,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:46,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:20:47,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:47,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66822336] [2022-11-02 20:20:47,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66822336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:20:47,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499628282] [2022-11-02 20:20:47,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:47,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:47,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:47,524 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:20:47,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2a370df-1e60-4767-aad5-4ed8aa9e3133/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:20:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:47,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-02 20:20:47,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:47,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:20:47,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:20:47,848 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:20:47,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:20:47,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:47,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:20:48,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:20:48,067 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:20:48,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:20:48,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:20:48,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:20:48,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:20:48,361 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-02 20:20:48,361 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 20:20:48,571 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:20:48,571 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 20:20:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:48,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:50,647 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 20:20:50,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_48| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_370))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48|) |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) (= .cse0 1)))) is different from false [2022-11-02 20:20:50,710 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_48| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_370))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48|) 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 20:20:50,768 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_48| Int) (v_ArrVal_367 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_370))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48|) 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 20:20:50,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_370 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_48| Int) (v_ArrVal_367 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_367) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_370))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_48|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (= .cse0 3) (= .cse0 1)))) is different from false [2022-11-02 20:20:51,154 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:51,154 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 107 treesize of output 73 [2022-11-02 20:20:51,221 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:51,222 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 10835 treesize of output 10569 [2022-11-02 20:20:51,404 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 10987 treesize of output 10571 [2022-11-02 20:20:51,901 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 10699 treesize of output 10123 [2022-11-02 20:20:52,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:20:55,862 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:55,863 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 7599 treesize of output 7477