./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/splice-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/splice-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-dbf71c6-m [2022-10-17 10:49:31,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:49:31,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:49:31,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:49:31,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:49:31,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:49:31,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:49:31,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:49:31,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:49:31,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:49:31,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:49:31,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:49:31,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:49:31,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:49:31,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:49:31,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:49:31,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:49:31,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:49:31,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:49:31,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:49:31,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:49:31,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:49:31,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:49:31,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:49:31,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:49:31,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:49:31,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:49:31,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:49:31,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:49:31,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:49:31,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:49:31,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:49:31,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:49:31,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:49:31,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:49:31,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:49:31,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:49:31,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:49:31,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:49:31,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:49:31,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:49:31,850 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-10-17 10:49:31,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:49:31,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:49:31,892 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:49:31,892 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:49:31,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:49:31,893 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:49:31,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:49:31,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:49:31,894 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:49:31,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:49:31,896 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:49:31,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:49:31,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:49:31,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:49:31,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 10:49:31,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:49:31,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 10:49:31,897 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:49:31,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:49:31,898 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:49:31,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 10:49:31,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:49:31,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:49:31,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:49:31,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:49:31,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:49:31,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:49:31,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 10:49:31,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:49:31,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:49:31,902 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 10:49:31,902 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 10:49:31,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 10:49:31,902 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_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/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_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc [2022-10-17 10:49:32,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:49:32,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:49:32,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:49:32,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:49:32,212 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:49:32,214 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/list-properties/splice-2.i [2022-10-17 10:49:32,298 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/data/7c3ad491a/45514fc73efe444596c4ec6787dd3b8d/FLAG59fff6984 [2022-10-17 10:49:32,794 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:49:32,794 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/sv-benchmarks/c/list-properties/splice-2.i [2022-10-17 10:49:32,808 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/data/7c3ad491a/45514fc73efe444596c4ec6787dd3b8d/FLAG59fff6984 [2022-10-17 10:49:33,104 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/data/7c3ad491a/45514fc73efe444596c4ec6787dd3b8d [2022-10-17 10:49:33,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:49:33,108 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:49:33,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:49:33,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:49:33,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:49:33,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:49:33" (1/1) ... [2022-10-17 10:49:33,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d8e183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:49:33, skipping insertion in model container [2022-10-17 10:49:33,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:49:33" (1/1) ... [2022-10-17 10:49:33,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:49:33,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:49:33,472 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_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2022-10-17 10:49:33,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:49:33,490 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:49:33,571 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_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2022-10-17 10:49:33,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:49:33,605 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:49:33,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:49:33 WrapperNode [2022-10-17 10:49:33,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:49:33,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:49:33,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:49:33,608 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:49:33,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:49:33" (1/1) ... [2022-10-17 10:49:33,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:49:33" (1/1) ... [2022-10-17 10:49:33,653 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 104 [2022-10-17 10:49:33,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:49:33,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:49:33,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:49:33,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:49:33,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:49:33" (1/1) ... [2022-10-17 10:49:33,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:49:33" (1/1) ... [2022-10-17 10:49:33,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:49:33" (1/1) ... [2022-10-17 10:49:33,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:49:33" (1/1) ... [2022-10-17 10:49:33,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:49:33" (1/1) ... [2022-10-17 10:49:33,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:49:33" (1/1) ... [2022-10-17 10:49:33,683 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:49:33" (1/1) ... [2022-10-17 10:49:33,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:49:33" (1/1) ... [2022-10-17 10:49:33,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:49:33,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:49:33,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:49:33,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:49:33,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:49:33" (1/1) ... [2022-10-17 10:49:33,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:49:33,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:49:33,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:49:33,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:49:33,768 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-10-17 10:49:33,769 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-10-17 10:49:33,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-17 10:49:33,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 10:49:33,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-17 10:49:33,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:49:33,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-17 10:49:33,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-17 10:49:33,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:49:33,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:49:33,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:49:33,879 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:49:33,881 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:49:33,922 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-10-17 10:49:34,185 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:49:34,192 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:49:34,192 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-17 10:49:34,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:49:34 BoogieIcfgContainer [2022-10-17 10:49:34,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:49:34,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:49:34,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:49:34,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:49:34,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:49:33" (1/3) ... [2022-10-17 10:49:34,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3d7dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:49:34, skipping insertion in model container [2022-10-17 10:49:34,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:49:33" (2/3) ... [2022-10-17 10:49:34,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3d7dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:49:34, skipping insertion in model container [2022-10-17 10:49:34,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:49:34" (3/3) ... [2022-10-17 10:49:34,205 INFO L112 eAbstractionObserver]: Analyzing ICFG splice-2.i [2022-10-17 10:49:34,223 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:49:34,224 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-17 10:49:34,298 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:49:34,315 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;@69d5abff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:49:34,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-17 10:49:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-17 10:49:34,340 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:49:34,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:49:34,343 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:49:34,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:49:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1192551972, now seen corresponding path program 1 times [2022-10-17 10:49:34,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:49:34,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351745188] [2022-10-17 10:49:34,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:49:34,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:49:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:49:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:49:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:49:34,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351745188] [2022-10-17 10:49:34,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351745188] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:49:34,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:49:34,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:49:34,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868958201] [2022-10-17 10:49:34,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:49:34,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-17 10:49:34,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:49:34,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-17 10:49:34,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-17 10:49:34,689 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:49:34,713 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2022-10-17 10:49:34,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-17 10:49:34,716 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-17 10:49:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:49:34,723 INFO L225 Difference]: With dead ends: 48 [2022-10-17 10:49:34,724 INFO L226 Difference]: Without dead ends: 23 [2022-10-17 10:49:34,728 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-10-17 10:49:34,732 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 10:49:34,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 10:49:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-10-17 10:49:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-10-17 10:49:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-10-17 10:49:34,780 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-10-17 10:49:34,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:49:34,780 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-10-17 10:49:34,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:34,782 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-10-17 10:49:34,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-17 10:49:34,784 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:49:34,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:49:34,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:49:34,785 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:49:34,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:49:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash 675462707, now seen corresponding path program 1 times [2022-10-17 10:49:34,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:49:34,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043753759] [2022-10-17 10:49:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:49:34,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:49:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:49:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:49:35,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:49:35,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043753759] [2022-10-17 10:49:35,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043753759] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:49:35,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:49:35,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 10:49:35,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270604913] [2022-10-17 10:49:35,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:49:35,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 10:49:35,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:49:35,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 10:49:35,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 10:49:35,075 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:49:35,165 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-10-17 10:49:35,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:49:35,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-17 10:49:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:49:35,167 INFO L225 Difference]: With dead ends: 40 [2022-10-17 10:49:35,169 INFO L226 Difference]: Without dead ends: 33 [2022-10-17 10:49:35,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:49:35,171 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:49:35,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:49:35,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-17 10:49:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-10-17 10:49:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-10-17 10:49:35,180 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2022-10-17 10:49:35,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:49:35,181 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-10-17 10:49:35,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-10-17 10:49:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-17 10:49:35,183 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:49:35,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:49:35,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:49:35,184 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:49:35,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:49:35,191 INFO L85 PathProgramCache]: Analyzing trace with hash 577924040, now seen corresponding path program 1 times [2022-10-17 10:49:35,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:49:35,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489131771] [2022-10-17 10:49:35,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:49:35,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:49:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:49:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:49:35,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:49:35,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489131771] [2022-10-17 10:49:35,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489131771] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:49:35,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:49:35,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 10:49:35,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471845885] [2022-10-17 10:49:35,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:49:35,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 10:49:35,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:49:35,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 10:49:35,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 10:49:35,370 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:35,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:49:35,454 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-10-17 10:49:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:49:35,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-17 10:49:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:49:35,457 INFO L225 Difference]: With dead ends: 47 [2022-10-17 10:49:35,457 INFO L226 Difference]: Without dead ends: 39 [2022-10-17 10:49:35,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:49:35,460 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:49:35,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:49:35,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-17 10:49:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-10-17 10:49:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-10-17 10:49:35,470 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 16 [2022-10-17 10:49:35,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:49:35,470 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-10-17 10:49:35,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-10-17 10:49:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-17 10:49:35,471 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:49:35,472 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:49:35,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:49:35,472 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:49:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:49:35,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1645466066, now seen corresponding path program 1 times [2022-10-17 10:49:35,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:49:35,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763562293] [2022-10-17 10:49:35,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:49:35,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:49:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:49:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:49:35,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:49:35,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763562293] [2022-10-17 10:49:35,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763562293] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:49:35,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:49:35,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:49:35,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029234184] [2022-10-17 10:49:35,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:49:35,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:49:35,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:49:35,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:49:35,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:49:35,783 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:49:35,929 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2022-10-17 10:49:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 10:49:35,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-17 10:49:35,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:49:35,931 INFO L225 Difference]: With dead ends: 70 [2022-10-17 10:49:35,932 INFO L226 Difference]: Without dead ends: 43 [2022-10-17 10:49:35,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:49:35,935 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:49:35,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 78 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:49:35,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-10-17 10:49:35,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-10-17 10:49:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-10-17 10:49:35,952 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 17 [2022-10-17 10:49:35,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:49:35,953 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-10-17 10:49:35,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:35,953 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-10-17 10:49:35,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-17 10:49:35,957 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:49:35,957 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:49:35,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 10:49:35,958 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:49:35,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:49:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1334445095, now seen corresponding path program 1 times [2022-10-17 10:49:35,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:49:35,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732033145] [2022-10-17 10:49:35,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:49:35,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:49:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:49:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:49:36,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:49:36,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732033145] [2022-10-17 10:49:36,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732033145] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:49:36,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082885403] [2022-10-17 10:49:36,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:49:36,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:49:36,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:49:36,798 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:49:36,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-17 10:49:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:49:36,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 45 conjunts are in the unsatisfiable core [2022-10-17 10:49:36,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:49:37,007 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-10-17 10:49:37,109 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-10-17 10:49:37,189 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-17 10:49:37,190 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-10-17 10:49:37,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:49:37,259 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-10-17 10:49:37,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10-17 10:49:37,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:49:37,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-17 10:49:37,477 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-10-17 10:49:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:49:37,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:49:37,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_102 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-10-17 10:49:37,578 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_98 Int) (v_ArrVal_102 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_98)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-10-17 10:49:37,697 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:49:37,698 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-10-17 10:49:37,713 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:49:37,714 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-10-17 10:49:37,726 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-10-17 10:49:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-10-17 10:49:37,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082885403] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:49:37,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:49:37,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-10-17 10:49:37,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510748920] [2022-10-17 10:49:37,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:49:37,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-17 10:49:37,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:49:37,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-17 10:49:37,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=389, Unknown=2, NotChecked=82, Total=552 [2022-10-17 10:49:37,899 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:49:42,830 INFO L93 Difference]: Finished difference Result 138 states and 177 transitions. [2022-10-17 10:49:42,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-17 10:49:42,831 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-17 10:49:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:49:42,833 INFO L225 Difference]: With dead ends: 138 [2022-10-17 10:49:42,833 INFO L226 Difference]: Without dead ends: 105 [2022-10-17 10:49:42,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=293, Invalid=1514, Unknown=7, NotChecked=166, Total=1980 [2022-10-17 10:49:42,836 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 98 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-17 10:49:42,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 259 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 344 Invalid, 0 Unknown, 165 Unchecked, 0.3s Time] [2022-10-17 10:49:42,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-10-17 10:49:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 61. [2022-10-17 10:49:42,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2022-10-17 10:49:42,850 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 23 [2022-10-17 10:49:42,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:49:42,851 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-10-17 10:49:42,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2022-10-17 10:49:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-17 10:49:42,852 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:49:42,853 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:49:42,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-17 10:49:43,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:49:43,067 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:49:43,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:49:43,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1115102530, now seen corresponding path program 1 times [2022-10-17 10:49:43,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:49:43,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754373996] [2022-10-17 10:49:43,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:49:43,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:49:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:49:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:49:43,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:49:43,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754373996] [2022-10-17 10:49:43,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754373996] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:49:43,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667909588] [2022-10-17 10:49:43,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:49:43,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:49:43,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:49:43,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:49:43,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-17 10:49:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:49:43,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-17 10:49:43,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:49:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-17 10:49:43,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-17 10:49:43,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667909588] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:49:43,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-17 10:49:43,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-10-17 10:49:43,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359069405] [2022-10-17 10:49:43,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:49:43,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:49:43,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:49:43,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:49:43,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:49:43,269 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:49:43,289 INFO L93 Difference]: Finished difference Result 115 states and 149 transitions. [2022-10-17 10:49:43,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:49:43,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-17 10:49:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:49:43,294 INFO L225 Difference]: With dead ends: 115 [2022-10-17 10:49:43,295 INFO L226 Difference]: Without dead ends: 82 [2022-10-17 10:49:43,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:49:43,299 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 10:49:43,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 60 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 10:49:43,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-10-17 10:49:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2022-10-17 10:49:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 69 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2022-10-17 10:49:43,329 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 25 [2022-10-17 10:49:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:49:43,330 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2022-10-17 10:49:43,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2022-10-17 10:49:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-17 10:49:43,332 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:49:43,332 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:49:43,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-17 10:49:43,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:49:43,549 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:49:43,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:49:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1793450878, now seen corresponding path program 1 times [2022-10-17 10:49:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:49:43,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716885099] [2022-10-17 10:49:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:49:43,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:49:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:49:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:49:44,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:49:44,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716885099] [2022-10-17 10:49:44,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716885099] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:49:44,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850532869] [2022-10-17 10:49:44,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:49:44,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:49:44,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:49:44,130 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:49:44,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-17 10:49:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:49:44,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjunts are in the unsatisfiable core [2022-10-17 10:49:44,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:49:44,253 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-10-17 10:49:44,259 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-10-17 10:49:44,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-17 10:49:44,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-17 10:49:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-17 10:49:44,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:49:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-17 10:49:44,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850532869] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:49:44,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:49:44,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-10-17 10:49:44,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292281189] [2022-10-17 10:49:44,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:49:44,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-17 10:49:44,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:49:44,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-17 10:49:44,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-10-17 10:49:44,378 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:49:44,595 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-10-17 10:49:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 10:49:44,596 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-17 10:49:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:49:44,596 INFO L225 Difference]: With dead ends: 83 [2022-10-17 10:49:44,597 INFO L226 Difference]: Without dead ends: 75 [2022-10-17 10:49:44,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-10-17 10:49:44,598 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:49:44,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 111 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:49:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-10-17 10:49:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-10-17 10:49:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 71 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2022-10-17 10:49:44,609 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 25 [2022-10-17 10:49:44,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:49:44,609 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2022-10-17 10:49:44,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:44,610 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2022-10-17 10:49:44,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-17 10:49:44,611 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:49:44,611 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:49:44,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-17 10:49:44,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:49:44,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:49:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:49:44,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1425682976, now seen corresponding path program 1 times [2022-10-17 10:49:44,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:49:44,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597100961] [2022-10-17 10:49:44,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:49:44,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:49:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:49:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:49:45,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:49:45,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597100961] [2022-10-17 10:49:45,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597100961] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:49:45,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302512623] [2022-10-17 10:49:45,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:49:45,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:49:45,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:49:45,542 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:49:45,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-17 10:49:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:49:45,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 49 conjunts are in the unsatisfiable core [2022-10-17 10:49:45,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:49:45,657 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-10-17 10:49:45,747 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-17 10:49:45,748 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-10-17 10:49:45,811 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-10-17 10:49:45,821 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-10-17 10:49:45,899 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-17 10:49:45,899 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-10-17 10:49:45,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-10-17 10:49:45,912 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-10-17 10:49:46,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-17 10:49:46,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-10-17 10:49:46,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-17 10:49:46,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2022-10-17 10:49:46,052 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-10-17 10:49:46,094 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-10-17 10:49:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:49:46,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:49:46,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-10-17 10:49:46,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_298) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2022-10-17 10:49:46,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_298) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 3)) is different from false [2022-10-17 10:49:46,214 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:49:46,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-10-17 10:49:46,225 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:49:46,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 78 [2022-10-17 10:49:46,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2022-10-17 10:49:46,263 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_297 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_297 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-10-17 10:49:46,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:49:46,298 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-10-17 10:49:46,305 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:49:46,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-10-17 10:49:46,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-17 10:49:46,327 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-17 10:49:46,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-10-17 10:49:46,340 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-17 10:49:46,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-10-17 10:49:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-10-17 10:49:46,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302512623] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:49:46,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:49:46,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 33 [2022-10-17 10:49:46,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737069388] [2022-10-17 10:49:46,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:49:46,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-17 10:49:46,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:49:46,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-17 10:49:46,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=741, Unknown=4, NotChecked=228, Total=1056 [2022-10-17 10:49:46,531 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:49:47,519 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-10-17 10:49:47,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-17 10:49:47,520 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-17 10:49:47,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:49:47,521 INFO L225 Difference]: With dead ends: 103 [2022-10-17 10:49:47,521 INFO L226 Difference]: Without dead ends: 76 [2022-10-17 10:49:47,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=1777, Unknown=4, NotChecked=356, Total=2352 [2022-10-17 10:49:47,523 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 78 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-17 10:49:47,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 320 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 420 Invalid, 0 Unknown, 177 Unchecked, 0.3s Time] [2022-10-17 10:49:47,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-10-17 10:49:47,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2022-10-17 10:49:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 71 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2022-10-17 10:49:47,540 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2022-10-17 10:49:47,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:49:47,542 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2022-10-17 10:49:47,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-10-17 10:49:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-17 10:49:47,548 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:49:47,549 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:49:47,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-10-17 10:49:47,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-10-17 10:49:47,766 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:49:47,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:49:47,766 INFO L85 PathProgramCache]: Analyzing trace with hash -154506453, now seen corresponding path program 2 times [2022-10-17 10:49:47,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:49:47,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603925715] [2022-10-17 10:49:47,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:49:47,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:49:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:49:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-17 10:49:47,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:49:47,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603925715] [2022-10-17 10:49:47,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603925715] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:49:47,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:49:47,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:49:47,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76436298] [2022-10-17 10:49:47,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:49:47,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:49:47,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:49:47,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:49:47,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:49:47,810 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:47,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:49:47,825 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2022-10-17 10:49:47,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:49:47,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-17 10:49:47,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:49:47,827 INFO L225 Difference]: With dead ends: 126 [2022-10-17 10:49:47,827 INFO L226 Difference]: Without dead ends: 72 [2022-10-17 10:49:47,827 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-10-17 10:49:47,829 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 10:49:47,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 10:49:47,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-10-17 10:49:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2022-10-17 10:49:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-10-17 10:49:47,839 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 32 [2022-10-17 10:49:47,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:49:47,840 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-10-17 10:49:47,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:49:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-10-17 10:49:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-17 10:49:47,841 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:49:47,841 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:49:47,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 10:49:47,841 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:49:47,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:49:47,842 INFO L85 PathProgramCache]: Analyzing trace with hash -972154903, now seen corresponding path program 1 times [2022-10-17 10:49:47,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:49:47,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318836262] [2022-10-17 10:49:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:49:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:49:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:49:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:49:48,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:49:48,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318836262] [2022-10-17 10:49:48,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318836262] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:49:48,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443626691] [2022-10-17 10:49:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:49:48,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:49:48,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:49:48,946 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:49:48,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b7f62a3-35cc-43fc-94ae-ecc85b6a1a39/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-17 10:49:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:49:49,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 69 conjunts are in the unsatisfiable core [2022-10-17 10:49:49,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:49:49,085 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-10-17 10:49:49,168 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-10-17 10:49:49,223 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-17 10:49:49,223 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-10-17 10:49:49,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:49:49,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-17 10:49:49,268 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-10-17 10:49:49,336 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-17 10:49:49,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-10-17 10:49:49,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:49:49,349 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-10-17 10:49:49,426 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-17 10:49:49,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-10-17 10:49:49,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-10-17 10:49:49,503 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-17 10:49:49,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-10-17 10:49:49,519 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-17 10:49:49,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-10-17 10:49:49,529 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-10-17 10:49:49,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-17 10:49:49,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-10-17 10:49:49,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-17 10:49:49,817 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-17 10:49:49,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-10-17 10:49:49,960 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-10-17 10:49:49,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2022-10-17 10:49:50,040 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-10-17 10:49:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:49:50,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:49:50,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|) 1)) is different from false [2022-10-17 10:49:50,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|))) is different from false [2022-10-17 10:49:50,072 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base|) (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4) v_ArrVal_459)) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset|) 1)) is different from false [2022-10-17 10:49:50,082 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_459)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_461)) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)) (= 3 |c_ULTIMATE.start_main_#t~mem8#1|)) is different from false [2022-10-17 10:49:50,093 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 .cse1 v_ArrVal_459)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1) v_ArrVal_461)) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)) (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) 3))) is different from false [2022-10-17 10:49:50,102 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse1 v_ArrVal_459)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-17 10:49:50,125 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 .cse2 v_ArrVal_459)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-10-17 10:49:50,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_50| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) is different from false [2022-10-17 10:49:50,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_50| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) is different from false [2022-10-17 10:49:50,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:49:50,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 111 [2022-10-17 10:49:50,280 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:49:50,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 820 treesize of output 813 [2022-10-17 10:49:50,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 399 treesize of output 391 [2022-10-17 10:49:50,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 790 treesize of output 774 [2022-10-17 10:49:53,122 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse38 (not .cse13)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse8 (or .cse38 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse45 (let ((.cse47 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse47 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse47 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse46 .cse4 v_ArrVal_459)) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (.cse14 (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse43 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (let ((.cse44 (store (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3))) (or (= (select (select (store (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse44 .cse4 v_ArrVal_459)) v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))))) (.cse22 (or .cse38 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse41 (let ((.cse42 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse42 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse42 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse40 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse39 (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse40 .cse4 v_ArrVal_459)))) (or (= (select (select (store .cse39 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse39 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (let ((.cse0 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_arrayElimCell_42 Int)) (or (forall ((v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse24 (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse26 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse26 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse25 .cse4 v_ArrVal_459)))) (or (= (select (select (store .cse23 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse23 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= 3 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|))) (or .cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse29 (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse30 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse30 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse28 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse27 (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse28 .cse4 v_ArrVal_459)))) (or (= (select (select (store .cse27 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse27 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse8 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_arrayElimCell_42 Int) (v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse32 (let ((.cse34 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse34 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse34 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int)) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse33 .cse4 v_ArrVal_459)))) (or (= (select (select (store .cse31 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse31 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse31 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= 3 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (or .cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse35 (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse37 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse37 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse36 .cse4 v_ArrVal_459)) v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse14 .cse22))) (and (or .cse0 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse2 (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse5 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse5 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 .cse4 v_ArrVal_459)))) (or (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse1 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= 3 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse8 (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse11 (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse12 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse12 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse10 .cse4 v_ArrVal_459)))) (or (= (select (select (store .cse9 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse9 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse13) (or .cse0 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) .cse14 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse16 (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse18 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse18 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int)) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse17 .cse4 v_ArrVal_459)))) (or (= (select (select (store .cse15 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store .cse15 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store .cse15 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= 3 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (or .cse13 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse19 (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse21 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse21 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse20 .cse4 v_ArrVal_459)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse22))))) is different from false