./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/ss1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/ss1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R --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 26cc6c43657aae3d6045b0e296032a25844d2e64f01344915dc1323c4b8b39f3 --- 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-38b53e6 [2022-11-25 15:32:31,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:32:31,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:32:31,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:32:31,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:32:31,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:32:31,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:32:31,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:32:31,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:32:31,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:32:31,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:32:31,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:32:31,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:32:31,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:32:31,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:32:31,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:32:31,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:32:31,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:32:31,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:32:31,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:32:31,896 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:32:31,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:32:31,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:32:31,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:32:31,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:32:31,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:32:31,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:32:31,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:32:31,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:32:31,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:32:31,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:32:31,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:32:31,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:32:31,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:32:31,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:32:31,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:32:31,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:32:31,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:32:31,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:32:31,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:32:31,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:32:31,915 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:32:31,937 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:32:31,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:32:31,938 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:32:31,938 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:32:31,939 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:32:31,939 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:32:31,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:32:31,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:32:31,954 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:32:31,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:32:31,954 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:32:31,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:32:31,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:32:31,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:32:31,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:32:31,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:32:31,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:32:31,957 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:32:31,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:32:31,957 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:32:31,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:32:31,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:32:31,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:32:31,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:32:31,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:32:31,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:32:31,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:32:31,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:32:31,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:32:31,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:32:31,960 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:32:31,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:32:31,961 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:32:31,961 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:32:31,961 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/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_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R 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 -> 26cc6c43657aae3d6045b0e296032a25844d2e64f01344915dc1323c4b8b39f3 [2022-11-25 15:32:32,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:32:32,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:32:32,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:32:32,261 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:32:32,262 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:32:32,263 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/array-fpi/ss1.c [2022-11-25 15:32:35,339 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:32:35,573 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:32:35,573 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/sv-benchmarks/c/array-fpi/ss1.c [2022-11-25 15:32:35,580 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/data/560d4b19b/ff0f37895b644c90a52e7fec24a0b4b2/FLAGc3cc267c7 [2022-11-25 15:32:35,595 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/data/560d4b19b/ff0f37895b644c90a52e7fec24a0b4b2 [2022-11-25 15:32:35,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:32:35,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:32:35,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:32:35,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:32:35,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:32:35,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:32:35" (1/1) ... [2022-11-25 15:32:35,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65116d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:35, skipping insertion in model container [2022-11-25 15:32:35,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:32:35" (1/1) ... [2022-11-25 15:32:35,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:32:35,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:32:35,812 WARN L237 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_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/sv-benchmarks/c/array-fpi/ss1.c[586,599] [2022-11-25 15:32:35,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:32:35,879 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:32:35,899 WARN L237 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_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/sv-benchmarks/c/array-fpi/ss1.c[586,599] [2022-11-25 15:32:35,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:32:35,939 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:32:35,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:35 WrapperNode [2022-11-25 15:32:35,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:32:35,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:32:35,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:32:35,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:32:35,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:35" (1/1) ... [2022-11-25 15:32:35,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:35" (1/1) ... [2022-11-25 15:32:36,001 INFO L138 Inliner]: procedures = 17, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2022-11-25 15:32:36,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:32:36,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:32:36,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:32:36,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:32:36,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:35" (1/1) ... [2022-11-25 15:32:36,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:35" (1/1) ... [2022-11-25 15:32:36,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:35" (1/1) ... [2022-11-25 15:32:36,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:35" (1/1) ... [2022-11-25 15:32:36,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:35" (1/1) ... [2022-11-25 15:32:36,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:35" (1/1) ... [2022-11-25 15:32:36,047 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:35" (1/1) ... [2022-11-25 15:32:36,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:35" (1/1) ... [2022-11-25 15:32:36,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:32:36,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:32:36,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:32:36,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:32:36,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:35" (1/1) ... [2022-11-25 15:32:36,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:32:36,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:32:36,094 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:32:36,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:32:36,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:32:36,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:32:36,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:32:36,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:32:36,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 15:32:36,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:32:36,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:32:36,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 15:32:36,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:32:36,250 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:32:36,256 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:32:36,441 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:32:36,448 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:32:36,448 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 15:32:36,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:32:36 BoogieIcfgContainer [2022-11-25 15:32:36,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:32:36,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:32:36,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:32:36,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:32:36,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:32:35" (1/3) ... [2022-11-25 15:32:36,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e45d24e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:32:36, skipping insertion in model container [2022-11-25 15:32:36,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:35" (2/3) ... [2022-11-25 15:32:36,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e45d24e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:32:36, skipping insertion in model container [2022-11-25 15:32:36,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:32:36" (3/3) ... [2022-11-25 15:32:36,469 INFO L112 eAbstractionObserver]: Analyzing ICFG ss1.c [2022-11-25 15:32:36,492 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:32:36,492 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 15:32:36,572 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:32:36,580 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;@2dd69954, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:32:36,581 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 15:32:36,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 15:32:36,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:32:36,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:32:36,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:32:36,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:32:36,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1202110748, now seen corresponding path program 1 times [2022-11-25 15:32:36,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:32:36,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534813950] [2022-11-25 15:32:36,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:32:36,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:32:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:32:36,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:32:36,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534813950] [2022-11-25 15:32:36,862 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-25 15:32:36,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851440538] [2022-11-25 15:32:36,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:32:36,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:32:36,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:32:36,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:32:36,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 15:32:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:32:37,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 15:32:37,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:32:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:32:37,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:32:37,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851440538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:32:37,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:32:37,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:32:37,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684732839] [2022-11-25 15:32:37,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:32:37,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:32:37,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:32:37,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:32:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:32:37,111 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:37,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:32:37,130 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-11-25 15:32:37,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:32:37,132 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2022-11-25 15:32:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:32:37,140 INFO L225 Difference]: With dead ends: 44 [2022-11-25 15:32:37,141 INFO L226 Difference]: Without dead ends: 20 [2022-11-25 15:32:37,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:32:37,147 INFO L413 NwaCegarLoop]: 28 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, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:32:37,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:32:37,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-25 15:32:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-25 15:32:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-11-25 15:32:37,183 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2022-11-25 15:32:37,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:32:37,184 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-11-25 15:32:37,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:37,185 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-11-25 15:32:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 15:32:37,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:32:37,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:32:37,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 15:32:37,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-25 15:32:37,391 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:32:37,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:32:37,392 INFO L85 PathProgramCache]: Analyzing trace with hash -944124056, now seen corresponding path program 1 times [2022-11-25 15:32:37,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:32:37,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215334969] [2022-11-25 15:32:37,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:32:37,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:32:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:32:37,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:32:37,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215334969] [2022-11-25 15:32:37,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-25 15:32:37,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574659195] [2022-11-25 15:32:37,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:32:37,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:32:37,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:32:37,439 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:32:37,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 15:32:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:32:37,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 15:32:37,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:32:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:32:37,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:32:37,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574659195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:32:37,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:32:37,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:32:37,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093857977] [2022-11-25 15:32:37,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:32:37,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:32:37,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:32:37,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:32:37,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:32:37,627 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:32:37,754 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-11-25 15:32:37,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:32:37,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-11-25 15:32:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:32:37,758 INFO L225 Difference]: With dead ends: 41 [2022-11-25 15:32:37,776 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 15:32:37,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:32:37,777 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:32:37,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 12 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:32:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 15:32:37,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-11-25 15:32:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-25 15:32:37,786 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2022-11-25 15:32:37,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:32:37,786 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-25 15:32:37,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-25 15:32:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 15:32:37,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:32:37,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:32:37,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 15:32:37,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:32:37,995 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:32:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:32:37,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1401448688, now seen corresponding path program 1 times [2022-11-25 15:32:37,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:32:37,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579069727] [2022-11-25 15:32:37,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:32:37,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:32:38,052 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 15:32:38,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712233345] [2022-11-25 15:32:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:32:38,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:32:38,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:32:38,063 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:32:38,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 15:32:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:32:38,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-25 15:32:38,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:32:38,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 15:32:38,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:32:38,427 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2022-11-25 15:32:38,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:32:38,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-25 15:32:38,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:32:38,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2022-11-25 15:32:38,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:32:38,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 27 [2022-11-25 15:32:39,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:32:39,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2022-11-25 15:32:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:32:39,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:32:39,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:32:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:32:40,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:32:40,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579069727] [2022-11-25 15:32:40,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 15:32:40,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712233345] [2022-11-25 15:32:40,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712233345] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:32:40,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:32:40,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-11-25 15:32:40,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221815306] [2022-11-25 15:32:40,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:32:40,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 15:32:40,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:32:40,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 15:32:40,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2022-11-25 15:32:40,065 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:46,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:32:46,849 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-11-25 15:32:46,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 15:32:46,850 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 15:32:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:32:46,851 INFO L225 Difference]: With dead ends: 51 [2022-11-25 15:32:46,851 INFO L226 Difference]: Without dead ends: 41 [2022-11-25 15:32:46,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=319, Invalid=1573, Unknown=0, NotChecked=0, Total=1892 [2022-11-25 15:32:46,854 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 73 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:32:46,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 49 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 15:32:46,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-25 15:32:46,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-11-25 15:32:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-11-25 15:32:46,867 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 23 [2022-11-25 15:32:46,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:32:46,867 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-11-25 15:32:46,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-11-25 15:32:46,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 15:32:46,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:32:46,869 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:32:46,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:32:47,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:32:47,076 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:32:47,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:32:47,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1774307726, now seen corresponding path program 2 times [2022-11-25 15:32:47,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:32:47,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279999285] [2022-11-25 15:32:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:32:47,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:32:47,132 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 15:32:47,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112751250] [2022-11-25 15:32:47,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:32:47,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:32:47,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:32:47,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:32:47,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 15:32:47,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 15:32:47,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:32:47,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:32:47,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:32:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 15:32:47,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:32:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 15:32:47,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:32:47,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279999285] [2022-11-25 15:32:47,382 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 15:32:47,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112751250] [2022-11-25 15:32:47,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112751250] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:32:47,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:32:47,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-25 15:32:47,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571660303] [2022-11-25 15:32:47,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:32:47,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:32:47,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:32:47,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:32:47,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:32:47,391 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:32:47,567 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2022-11-25 15:32:47,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:32:47,568 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 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 25 [2022-11-25 15:32:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:32:47,570 INFO L225 Difference]: With dead ends: 80 [2022-11-25 15:32:47,570 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 15:32:47,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-25 15:32:47,577 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:32:47,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 30 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:32:47,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 15:32:47,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2022-11-25 15:32:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-11-25 15:32:47,602 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2022-11-25 15:32:47,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:32:47,603 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-11-25 15:32:47,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:47,603 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-11-25 15:32:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 15:32:47,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:32:47,605 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:32:47,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 15:32:47,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:32:47,810 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:32:47,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:32:47,812 INFO L85 PathProgramCache]: Analyzing trace with hash 119582130, now seen corresponding path program 3 times [2022-11-25 15:32:47,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:32:47,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130187094] [2022-11-25 15:32:47,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:32:47,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:32:47,861 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 15:32:47,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [359014081] [2022-11-25 15:32:47,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:32:47,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:32:47,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:32:47,863 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:32:47,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 15:32:47,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 15:32:47,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:32:47,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:32:47,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:32:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 15:32:48,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:32:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 15:32:48,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:32:48,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130187094] [2022-11-25 15:32:48,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 15:32:48,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359014081] [2022-11-25 15:32:48,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359014081] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:32:48,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:32:48,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-25 15:32:48,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858742602] [2022-11-25 15:32:48,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:32:48,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:32:48,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:32:48,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:32:48,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:32:48,064 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:48,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:32:48,214 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-11-25 15:32:48,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:32:48,215 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 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 25 [2022-11-25 15:32:48,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:32:48,216 INFO L225 Difference]: With dead ends: 47 [2022-11-25 15:32:48,216 INFO L226 Difference]: Without dead ends: 35 [2022-11-25 15:32:48,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-11-25 15:32:48,217 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:32:48,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 23 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:32:48,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-25 15:32:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-11-25 15:32:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-25 15:32:48,226 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2022-11-25 15:32:48,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:32:48,226 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-25 15:32:48,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-25 15:32:48,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 15:32:48,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:32:48,227 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:32:48,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 15:32:48,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:32:48,433 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:32:48,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:32:48,433 INFO L85 PathProgramCache]: Analyzing trace with hash 666081912, now seen corresponding path program 4 times [2022-11-25 15:32:48,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:32:48,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335745559] [2022-11-25 15:32:48,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:32:48,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:32:48,464 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 15:32:48,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1063500376] [2022-11-25 15:32:48,464 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 15:32:48,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:32:48,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:32:48,466 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:32:48,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 15:32:48,579 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 15:32:48,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:32:48,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-25 15:32:48,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:32:48,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 15:32:48,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 15:32:48,637 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2022-11-25 15:32:48,707 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-25 15:32:48,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:32:48,883 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 15:32:48,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 46 [2022-11-25 15:32:49,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:32:49,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:32:49,025 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-25 15:32:49,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 58 [2022-11-25 15:32:49,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:32:49,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:32:49,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:32:49,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:32:49,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:32:49,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2022-11-25 15:32:49,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:32:49,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:32:49,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 46 [2022-11-25 15:32:49,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:32:49,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:32:49,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 47 [2022-11-25 15:32:50,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:32:50,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:32:50,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2022-11-25 15:32:50,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 38 [2022-11-25 15:32:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:32:50,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:33:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:35,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:35,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335745559] [2022-11-25 15:33:35,403 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 15:33:35,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063500376] [2022-11-25 15:33:35,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063500376] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:33:35,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:33:35,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-11-25 15:33:35,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902142717] [2022-11-25 15:33:35,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:33:35,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-25 15:33:35,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:35,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-25 15:33:35,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1851, Unknown=8, NotChecked=0, Total=2070 [2022-11-25 15:33:35,408 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 46 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:35:01,202 WARN L233 SmtUtils]: Spent 36.09s on a formula simplification. DAG size of input: 206 DAG size of output: 122 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:35:03,341 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse69 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (+ .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse32 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0))) (.cse0 (< 2 c_~N~0)) (.cse1 (< .cse32 c_~N~0)) (.cse31 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse54 (store .cse14 .cse15 1)) (.cse30 (+ .cse69 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or .cse0 .cse1 (= .cse2 (let ((.cse4 (select .cse14 .cse15))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse4 .cse7)))) (store .cse11 .cse9 (+ (select .cse12 .cse9) (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse7 .cse8))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (<= c_~N~0 2) (= (select .cse14 .cse9) 1) (= .cse3 0) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse29 (store .cse14 .cse30 1))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse28 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse21 (select .cse29 (+ .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse22 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse28 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse23 (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse21 .cse22))))) (let ((.cse25 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse18 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse24 (store .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse16 .cse18 .cse21 .cse22)))) (store .cse24 .cse9 (+ (select (select (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse25 .cse9))))))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse16 .cse17 .cse18 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18 .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse21 .cse22))))))))))))) (< .cse31 ~N~0) (not (< .cse32 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (= (let ((.cse34 (select .cse14 .cse30))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse34))))) (let ((.cse40 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse35 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse36 (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse39 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse34 .cse35)))) (store .cse39 .cse9 (+ (select (select (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse40 .cse9))))))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse33 .cse34 .cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))))) .cse2) .cse0 (< .cse31 c_~N~0) (not .cse1)) (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54))) (let ((.cse53 (* |v_ULTIMATE.start_main_~i~0#1_71| 8)) (.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse44 (select .cse54 (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse47 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse53 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse48 (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse44 .cse47))))) (let ((.cse50 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse43 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse45 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse49 (store .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse42 .cse43 .cse44 .cse47)))) (store .cse49 .cse9 (+ (select .cse50 .cse9) (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse41 .cse42 .cse43 .cse44 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43 .cse44 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse47))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0))) (< .cse32 ~N~0) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (< 1 c_~N~0) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< .cse31 ~N~0) (not (< .cse32 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse68 (store .cse54 .cse30 1))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse68))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse67 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse55 (select .cse68 (+ .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse56 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse59 (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse67 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse62 (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56 .cse59))))) (let ((.cse64 (select .cse62 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse57 (select .cse64 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse60 (store .cse62 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse63 (store .cse64 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse55 .cse56 .cse57 .cse59)))) (store .cse63 .cse9 (+ (select .cse64 .cse9) (select (select (store .cse62 |c_ULTIMATE.start_main_~a~0#1.base| .cse63) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse61 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse55 .cse56 .cse57 .cse58 .cse59 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56 .cse57 .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= |c_ULTIMATE.start_main_~i~0#1| 2) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))))) is different from false [2022-11-25 15:35:06,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:35:08,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:35:10,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:35:13,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:35:15,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:35:17,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:35:19,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:36:58,038 WARN L233 SmtUtils]: Spent 50.75s on a formula simplification. DAG size of input: 226 DAG size of output: 122 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:37:00,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:37:02,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:37:04,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:37:06,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:37:08,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:37:10,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:37:13,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:37:15,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:37:17,569 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse49 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse34 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse15 (+ .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0))) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (< 2 c_~N~0)) (.cse1 (< .cse49 c_~N~0))) (and (or .cse0 .cse1 (= .cse2 (let ((.cse4 (select .cse14 .cse15))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse4 .cse7)))) (store .cse11 .cse9 (+ (select .cse12 .cse9) (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse7 .cse8))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (or .cse0 (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= .cse2 (let ((.cse25 (* |ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse21 (select .cse14 (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse25 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse17 .cse21))))) (let ((.cse24 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse18 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse23 (store .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse17 .cse18 .cse21)))) (store .cse23 .cse9 (+ (select .cse24 .cse9) (select (select (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse16 .cse17 .cse18 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse16 .cse17 .cse18 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse21))))))))))) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0)))) (or (= (let ((.cse27 (select .cse14 (+ .cse34 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse27))))) (let ((.cse33 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse28 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse29 (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse32 (store .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse27 .cse28)))) (store .cse32 .cse9 (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse33 .cse9))))))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse26 .cse27 .cse28 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse26 .cse27 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))))) .cse2) .cse0 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not .cse1)) (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= (let ((.cse48 (store .cse14 .cse15 1))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse48))) (let ((.cse47 (* |v_ULTIMATE.start_main_~i~0#1_71| 8)) (.cse46 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse36 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse38 (select .cse48 (+ .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse41 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse47 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse42 (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse38 .cse41))))) (let ((.cse44 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse37 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse39 (store .cse42 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse43 (store .cse44 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse36 .cse37 .cse38 .cse41)))) (store .cse43 .cse9 (+ (select .cse44 .cse9) (select (select (store .cse42 |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse35 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse35 .cse36 .cse37 .cse38 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36 .cse37 .cse38 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse41)))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0))) (< .cse49 ~N~0) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (or (= .cse2 (let ((.cse53 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse54 (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse53)))) (store .cse54 .cse9 (+ (select .cse14 .cse9) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse50 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse50 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse53)))))) .cse0 .cse1)))) is different from false [2022-11-25 15:37:27,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:37:28,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:37:41,879 WARN L233 SmtUtils]: Spent 6.96s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:37:45,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:37:50,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:37:53,865 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse71 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (+ .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse33 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0))) (.cse0 (< 2 c_~N~0)) (.cse1 (< .cse33 c_~N~0)) (.cse32 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (store .cse14 .cse15 1)) (.cse31 (+ .cse71 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or .cse0 .cse1 (= .cse2 (let ((.cse4 (select .cse14 .cse15))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse4 .cse7)))) (store .cse11 .cse9 (+ (select .cse12 .cse9) (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse7 .cse8))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (<= c_~N~0 2) (= (select .cse14 .cse9) 1) (exists ((|v_ULTIMATE.start_main_~i~0#1_57| Int)) (and (= .cse3 (let ((.cse16 (* |v_ULTIMATE.start_main_~i~0#1_57| 8))) (+ (select .cse14 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select .cse14 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8)))))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_57| 1)) (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0))) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse30 (store .cse14 .cse31 1))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse29 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse22 (select .cse30 (+ .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse23 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse17 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse29 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse24 (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse22 .cse23))))) (let ((.cse26 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse19 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse20 (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse25 (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse17 .cse19 .cse22 .cse23)))) (store .cse25 .cse9 (+ (select (select (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse26 .cse9))))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse17 .cse18 .cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18 .cse19 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse22 .cse23))))))))))))) (< .cse32 ~N~0) (not (< .cse33 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((|v_ULTIMATE.start_main_~i~0#1_57| Int)) (and (= .cse3 (let ((.cse34 (* |v_ULTIMATE.start_main_~i~0#1_57| 8))) (+ (select .cse14 (+ .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select .cse14 (+ .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8)))))) (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_57| 1)))) (or (= (let ((.cse36 (select .cse14 .cse31))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse36))))) (let ((.cse42 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse37 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse38 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse41 (store .cse42 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse36 .cse37)))) (store .cse41 .cse9 (+ (select (select (store .cse40 |c_ULTIMATE.start_main_~a~0#1.base| .cse41) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse42 .cse9))))))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse35 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse35 .cse36 .cse37 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse35 .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))))) .cse2) .cse0 (< .cse32 c_~N~0) (not .cse1)) (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse56))) (let ((.cse55 (* |v_ULTIMATE.start_main_~i~0#1_71| 8)) (.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse46 (select .cse56 (+ .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse49 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse55 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse50 (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse46 .cse49))))) (let ((.cse52 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse45 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse47 (store .cse50 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse51 (store .cse52 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse44 .cse45 .cse46 .cse49)))) (store .cse51 .cse9 (+ (select .cse52 .cse9) (select (select (store .cse50 |c_ULTIMATE.start_main_~a~0#1.base| .cse51) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse43 .cse44 .cse45 .cse46 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44 .cse45 .cse46 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse49))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0))) (< .cse33 ~N~0) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (< 1 c_~N~0) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< .cse32 ~N~0) (not (< .cse33 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse70 (store .cse56 .cse31 1))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse70))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse69 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse57 (select .cse70 (+ .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse58 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse61 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse69 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse64 (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58 .cse61))))) (let ((.cse66 (select .cse64 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse59 (select .cse66 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse62 (store .cse64 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse65 (store .cse66 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse57 .cse58 .cse59 .cse61)))) (store .cse65 .cse9 (+ (select .cse66 .cse9) (select (select (store .cse64 |c_ULTIMATE.start_main_~a~0#1.base| .cse65) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse63 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse60 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse57 .cse58 .cse59 .cse60 .cse61 (select (select (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58 .cse59 .cse60 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))))) is different from false [2022-11-25 15:38:19,828 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse62 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse19 (+ .cse62 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select .cse18 .cse19))) (let ((.cse42 (+ .cse1 .cse35)) (.cse20 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse21 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0))) (.cse10 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse22 (< 2 c_~N~0)) (.cse2 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (and (<= c_~N~0 2) (or (= .cse0 .cse1) .cse2) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse17 (store .cse18 .cse19 1))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse16 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse8 (select .cse17 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse9 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse16 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse11 (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8 .cse9))))) (let ((.cse13 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse5 .cse8 .cse9)))) (store .cse12 .cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse13 .cse10))))))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse8 .cse9))))))))))))) (< .cse20 ~N~0) (not (< .cse21 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or .cse22 .cse2 (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= .cse0 (let ((.cse33 (* |ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse28 (select .cse18 (+ .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse33 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse24 .cse28))))) (let ((.cse31 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse25 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse26 (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse30 (store .cse31 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse24 .cse25 .cse28)))) (store .cse30 .cse10 (+ (select .cse31 .cse10) (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 .cse23 .cse24 .cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse23 .cse24 .cse25 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse28))))))))))) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0)))) (or (= (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse42)))) (let ((.cse41 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse36 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse37 (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse40 (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse35 .cse36)))) (store .cse40 .cse10 (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse41 .cse10))))))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 .cse34 .cse35 .cse36 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse34 .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))))))) .cse0) .cse22 (< .cse20 c_~N~0) (not (< .cse21 c_~N~0))) (= .cse1 2) (or .cse22 (= (let ((.cse47 (store .cse18 .cse19 .cse42))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse47))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse44 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse43 .cse44 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))))) .cse0)) (< 1 c_~N~0) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< .cse20 ~N~0) (not (< .cse21 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse61 (store (store .cse18 (+ .cse62 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) .cse19 1))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse61))) (let ((.cse59 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse60 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse48 (select .cse61 (+ .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse49 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse52 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse60 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse55 (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse52))))) (let ((.cse57 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse50 (select .cse57 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse53 (store .cse55 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse56 (store .cse57 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse48 .cse49 .cse50 .cse52)))) (store .cse56 .cse10 (+ (select .cse57 .cse10) (select (select (store .cse55 |c_ULTIMATE.start_main_~a~0#1.base| .cse56) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse51 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse48 .cse49 .cse50 .cse51 .cse52 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse49 .cse50 .cse51 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)))))))))))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (or (= .cse0 (let ((.cse66 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse67 (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse66)))) (store .cse67 .cse10 (+ (select .cse18 .cse10) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse67) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse65 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse63 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 .cse63 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse63 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse66)))))) .cse22 .cse2) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_57| Int)) (let ((.cse68 (* |v_ULTIMATE.start_main_~i~0#1_57| 8))) (and (= (+ .cse1 1) (select .cse18 (+ .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (* .cse1 2) (+ 1 (select .cse18 (+ .cse68 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))))) (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_57| 1)))))))))) is different from false [2022-11-25 15:40:45,579 WARN L233 SmtUtils]: Spent 1.13m on a formula simplification. DAG size of input: 259 DAG size of output: 153 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:40:56,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:40:58,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:41:00,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:41:02,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:41:04,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:41:06,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:41:08,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:41:09,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:41:11,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:41:13,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:41:16,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:41:18,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:41:20,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-11-25 15:41:42,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:42:09,622 WARN L233 SmtUtils]: Spent 16.96s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:42:13,544 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse70 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (+ .cse70 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse32 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0))) (.cse0 (< 2 c_~N~0)) (.cse1 (< .cse32 c_~N~0)) (.cse31 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse54 (store .cse14 .cse15 1)) (.cse30 (+ .cse70 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or .cse0 .cse1 (= .cse2 (let ((.cse4 (select .cse14 .cse15))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse4 .cse7)))) (store .cse11 .cse9 (+ (select .cse12 .cse9) (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse7 .cse8))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (<= c_~N~0 2) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse29 (store .cse14 .cse30 1))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse28 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse21 (select .cse29 (+ .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse22 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse28 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse23 (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse21 .cse22))))) (let ((.cse25 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse18 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse24 (store .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse16 .cse18 .cse21 .cse22)))) (store .cse24 .cse9 (+ (select (select (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse25 .cse9))))))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse16 .cse17 .cse18 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18 .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse21 .cse22))))))))))))) (< .cse31 ~N~0) (not (< .cse32 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (= .cse3 8) (or (= (let ((.cse34 (select .cse14 .cse30))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse34))))) (let ((.cse40 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse35 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse36 (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse39 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse3 .cse34 .cse35)))) (store .cse39 .cse9 (+ (select (select (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse40 .cse9))))))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 .cse33 .cse34 .cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))))))))) .cse2) .cse0 (< .cse31 c_~N~0) (not .cse1)) (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54))) (let ((.cse53 (* |v_ULTIMATE.start_main_~i~0#1_71| 8)) (.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse44 (select .cse54 (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse47 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse53 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse48 (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse44 .cse47))))) (let ((.cse50 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse43 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse45 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse49 (store .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse42 .cse43 .cse44 .cse47)))) (store .cse49 .cse9 (+ (select .cse50 .cse9) (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse41 .cse42 .cse43 .cse44 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43 .cse44 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse47))))))))))) (+ (* 2 ~N~0) (* ~N~0 ~N~0))) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0))) (< .cse32 ~N~0) (< 2 ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (< 1 c_~N~0) (forall ((~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< .cse31 ~N~0) (not (< .cse32 ~N~0)) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 1) ~N~0)) (= (+ (* 2 ~N~0) (* ~N~0 ~N~0)) (let ((.cse68 (store .cse54 .cse30 1))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse68))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse67 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (let ((.cse55 (select .cse68 (+ .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse56 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse59 (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse67 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse62 (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56 .cse59))))) (let ((.cse64 (select .cse62 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse57 (select .cse64 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse60 (store .cse62 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse63 (store .cse64 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse55 .cse56 .cse57 .cse59)))) (store .cse63 .cse9 (+ (select .cse64 .cse9) (select (select (store .cse62 |c_ULTIMATE.start_main_~a~0#1.base| .cse63) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse61 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse55 .cse56 .cse57 .cse58 .cse59 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse55 .cse56 .cse57 .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_71| 2) ~N~0) (< 2 ~N~0))) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse69 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= 3 (select .cse69 8)) (= 3 (select .cse69 0)) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|))))) (<= |c_ULTIMATE.start_main_~i~0#1| 2))))) is different from false [2022-11-25 15:42:17,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:42:19,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:42:21,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:42:34,349 WARN L233 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:42:36,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:42:39,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:42:41,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 15:42:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:42:52,681 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2022-11-25 15:42:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-25 15:42:52,682 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-25 15:42:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:42:52,684 INFO L225 Difference]: With dead ends: 99 [2022-11-25 15:42:52,684 INFO L226 Difference]: Without dead ends: 85 [2022-11-25 15:42:52,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 492.6s TimeCoverageRelationStatistics Valid=530, Invalid=4536, Unknown=66, NotChecked=720, Total=5852 [2022-11-25 15:42:52,687 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 116 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 107.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 108.7s IncrementalHoareTripleChecker+Time [2022-11-25 15:42:52,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 138 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 973 Invalid, 26 Unknown, 33 Unchecked, 108.7s Time] [2022-11-25 15:42:52,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-25 15:42:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2022-11-25 15:42:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.171875) internal successors, (75), 64 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:42:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2022-11-25 15:42:52,719 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 31 [2022-11-25 15:42:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:42:52,719 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2022-11-25 15:42:52,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:42:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-11-25 15:42:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 15:42:52,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:42:52,722 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:42:52,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 15:42:52,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:42:52,929 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:42:52,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash 207824378, now seen corresponding path program 5 times [2022-11-25 15:42:52,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:42:52,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671903783] [2022-11-25 15:42:52,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:52,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:42:52,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 15:42:52,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1479212821] [2022-11-25 15:42:52,959 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 15:42:52,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:42:52,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:42:52,966 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:42:52,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 15:42:53,070 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-25 15:42:53,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:42:53,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:42:53,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 15:42:53,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:42:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 15:42:53,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:42:53,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671903783] [2022-11-25 15:42:53,448 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 15:42:53,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479212821] [2022-11-25 15:42:53,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479212821] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:42:53,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:42:53,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-25 15:42:53,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041186232] [2022-11-25 15:42:53,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:42:53,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 15:42:53,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:42:53,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 15:42:53,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-25 15:42:53,451 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:42:53,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:42:53,908 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-11-25 15:42:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 15:42:53,909 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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 33 [2022-11-25 15:42:53,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:42:53,910 INFO L225 Difference]: With dead ends: 116 [2022-11-25 15:42:53,910 INFO L226 Difference]: Without dead ends: 74 [2022-11-25 15:42:53,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:42:53,911 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 88 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:42:53,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 31 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:42:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-25 15:42:53,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2022-11-25 15:42:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:42:53,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-11-25 15:42:53,936 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 33 [2022-11-25 15:42:53,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:42:53,937 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-11-25 15:42:53,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:42:53,937 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-11-25 15:42:53,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 15:42:53,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:42:53,938 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:42:53,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-25 15:42:54,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:42:54,139 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:42:54,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:54,139 INFO L85 PathProgramCache]: Analyzing trace with hash 236928956, now seen corresponding path program 6 times [2022-11-25 15:42:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:42:54,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163473387] [2022-11-25 15:42:54,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:54,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:42:54,168 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 15:42:54,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638893926] [2022-11-25 15:42:54,180 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 15:42:54,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:42:54,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:42:54,181 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:42:54,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 15:42:54,318 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-25 15:42:54,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:42:54,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:42:54,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 15:42:54,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:42:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 15:42:54,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:42:54,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163473387] [2022-11-25 15:42:54,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 15:42:54,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638893926] [2022-11-25 15:42:54,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638893926] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:42:54,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:42:54,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-25 15:42:54,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661191184] [2022-11-25 15:42:54,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:42:54,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 15:42:54,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:42:54,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 15:42:54,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-25 15:42:54,685 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:42:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:42:55,150 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-11-25 15:42:55,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:42:55,151 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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 35 [2022-11-25 15:42:55,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:42:55,152 INFO L225 Difference]: With dead ends: 69 [2022-11-25 15:42:55,152 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 15:42:55,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-11-25 15:42:55,153 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 46 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:42:55,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 26 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:42:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 15:42:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-11-25 15:42:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:42:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-11-25 15:42:55,173 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 35 [2022-11-25 15:42:55,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:42:55,174 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-11-25 15:42:55,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:42:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-11-25 15:42:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 15:42:55,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:42:55,175 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:42:55,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 15:42:55,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 15:42:55,382 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:42:55,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:42:55,382 INFO L85 PathProgramCache]: Analyzing trace with hash 315843584, now seen corresponding path program 7 times [2022-11-25 15:42:55,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:42:55,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574059161] [2022-11-25 15:42:55,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:42:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:42:55,406 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 15:42:55,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171708710] [2022-11-25 15:42:55,417 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 15:42:55,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:42:55,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:42:55,419 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:42:55,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81703fa9-7ea1-46c6-b7f4-c23b83f57dbf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 15:42:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:42:55,538 WARN L261 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-25 15:42:55,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:42:55,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 15:42:55,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 15:42:55,691 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2022-11-25 15:42:55,841 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-25 15:42:56,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-11-25 15:42:56,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:56,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:42:56,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:56,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 15:42:56,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:56,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:56,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:56,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:42:56,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2022-11-25 15:42:57,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:57,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:57,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2022-11-25 15:42:57,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:57,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:42:57,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:57,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2022-11-25 15:42:57,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:57,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:57,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:57,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:57,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:42:57,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 51 [2022-11-25 15:42:57,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:58,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:58,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 51 [2022-11-25 15:42:58,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:58,398 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:42:58,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:58,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 15:42:58,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:58,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:58,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:42:58,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:42:58,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2022-11-25 15:42:59,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-11-25 15:42:59,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-11-25 15:42:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:42:59,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:44:23,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 15:44:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:44:23,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:23,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574059161] [2022-11-25 15:44:23,338 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 15:44:23,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171708710] [2022-11-25 15:44:23,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171708710] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:44:23,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:44:23,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 58 [2022-11-25 15:44:23,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043581060] [2022-11-25 15:44:23,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:44:23,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-25 15:44:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:23,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-25 15:44:23,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=3023, Unknown=3, NotChecked=0, Total=3306 [2022-11-25 15:44:23,350 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 58 states, 58 states have (on average 1.293103448275862) internal successors, (75), 58 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:47,709 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse91 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse90 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse19 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse73 (store .cse91 (+ .cse90 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse92 (+ .cse90 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse57 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) (let ((.cse20 (not .cse57)) (.cse21 (<= (mod c_~N~0 4294967296) 536870911)) (.cse37 (store .cse73 .cse92 1)) (.cse38 (not .cse19)) (.cse0 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0))) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse18 (store .cse91 .cse92 1)) (.cse55 (+ .cse90 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (and (or (= .cse0 (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse1 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse12 (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse7 .cse8 .cse9))))) (let ((.cse14 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse13 (let ((.cse15 (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse5 .cse7 .cse8 .cse9)))) (store .cse15 .cse11 (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse14 .cse11)))))) (store .cse13 .cse10 (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse14 .cse10))))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))))))))))))) .cse19 .cse20) .cse21 (or (= .cse0 (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse25 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse31 (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse25 .cse30))))) (let ((.cse33 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse29 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse26 (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse32 (let ((.cse34 (store .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse23 .cse24 .cse25 .cse29 .cse30)))) (store .cse34 .cse11 (+ (select .cse33 .cse11) (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse32 .cse10 (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse33 .cse10))))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse22 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse25 .cse28 .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ .cse22 .cse23 .cse24 .cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23 .cse24 .cse25 .cse28 .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse28 .cse29 .cse30)))))))))))))) .cse19 .cse20) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse21) (and (not .cse21) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or .cse38 (= .cse0 (let ((.cse54 (store .cse37 .cse55 1))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse42 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse45 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse46 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse48 (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse45 .cse46))))) (let ((.cse50 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse47 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse43 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse49 (let ((.cse51 (store .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse41 .cse42 .cse45 .cse46 .cse47)))) (store .cse51 .cse11 (+ (select .cse50 .cse11) (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| .cse51) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse49 .cse10 (+ (select .cse50 .cse10) (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse40 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41 .cse42 .cse45 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ .cse39 .cse40 .cse41 .cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41 .cse42 .cse45 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse45 .cse46 .cse47))))))))))))))) .cse56) (or .cse57 (= .cse0 (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse73))) (let ((.cse72 (select .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (select .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse63 (select .cse73 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse61 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse59 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse61 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse67 (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse61 .cse63))))) (let ((.cse69 (select .cse67 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse60 (select .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse65 (store .cse67 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse68 (let ((.cse70 (store .cse69 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse58 .cse59 .cse60 .cse61 .cse63)))) (store .cse70 .cse11 (+ (select (select (store .cse67 |c_ULTIMATE.start_main_~a~0#1.base| .cse70) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse69 .cse11)))))) (store .cse68 .cse10 (+ (select (select (store .cse67 |c_ULTIMATE.start_main_~a~0#1.base| .cse68) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse69 .cse10))))))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse62 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse64 (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse60 .cse61 .cse62 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))))))))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (or .cse38 (= .cse0 (let ((.cse89 (store .cse18 .cse55 1))) (let ((.cse87 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse89))) (let ((.cse88 (select .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse75 (select .cse89 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse78 (select .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (select (select (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse76 (select (select (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse83 (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse76 .cse77 .cse78))))) (let ((.cse85 (select .cse83 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse82 (select .cse85 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse80 (store .cse83 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse84 (let ((.cse86 (store .cse85 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse75 .cse76 .cse77 .cse78 .cse82)))) (store .cse86 .cse11 (+ (select (select (store .cse83 |c_ULTIMATE.start_main_~a~0#1.base| .cse86) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse85 .cse11)))))) (store .cse84 .cse10 (+ (select .cse85 .cse10) (select (select (store .cse83 |c_ULTIMATE.start_main_~a~0#1.base| .cse84) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse81 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse74 (select .cse81 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse79 (select (select (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse75 .cse76 .cse77 .cse78 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ .cse74 .cse75 .cse76 .cse77 .cse78 .cse79 (select (select (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse75 .cse76 .cse77 .cse78 .cse79 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse82))))))))))))))) .cse56))))) is different from false [2022-11-25 15:44:49,727 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse91 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse90 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse19 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse73 (store .cse91 (+ .cse90 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse92 (+ .cse90 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse57 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) (let ((.cse20 (not .cse57)) (.cse21 (<= (mod c_~N~0 4294967296) 536870911)) (.cse37 (store .cse73 .cse92 1)) (.cse38 (not .cse19)) (.cse0 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0))) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse18 (store .cse91 .cse92 1)) (.cse55 (+ .cse90 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) (and (or (= .cse0 (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse1 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse12 (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse7 .cse8 .cse9))))) (let ((.cse14 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse13 (let ((.cse15 (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse5 .cse7 .cse8 .cse9)))) (store .cse15 .cse11 (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse14 .cse11)))))) (store .cse13 .cse10 (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse14 .cse10))))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))))))))))))) .cse19 .cse20) .cse21 (or (= .cse0 (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse25 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse31 (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse25 .cse30))))) (let ((.cse33 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse29 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse26 (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse32 (let ((.cse34 (store .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse23 .cse24 .cse25 .cse29 .cse30)))) (store .cse34 .cse11 (+ (select .cse33 .cse11) (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse32 .cse10 (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse33 .cse10))))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse22 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse25 .cse28 .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ .cse22 .cse23 .cse24 .cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23 .cse24 .cse25 .cse28 .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse28 .cse29 .cse30)))))))))))))) .cse19 .cse20) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse21) (and (not .cse21) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (or .cse38 (= .cse0 (let ((.cse54 (store .cse37 .cse55 1))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse42 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse45 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse46 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse48 (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse45 .cse46))))) (let ((.cse50 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse47 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse43 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse49 (let ((.cse51 (store .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse41 .cse42 .cse45 .cse46 .cse47)))) (store .cse51 .cse11 (+ (select .cse50 .cse11) (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| .cse51) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse49 .cse10 (+ (select .cse50 .cse10) (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse40 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41 .cse42 .cse45 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ .cse39 .cse40 .cse41 .cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41 .cse42 .cse45 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse45 .cse46 .cse47))))))))))))))) .cse56) (or .cse57 (= .cse0 (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse73))) (let ((.cse72 (select .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (select .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse63 (select .cse73 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse61 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse59 (select (select (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse61 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse67 (store .cse71 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse61 .cse63))))) (let ((.cse69 (select .cse67 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse60 (select .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse65 (store .cse67 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse68 (let ((.cse70 (store .cse69 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse58 .cse59 .cse60 .cse61 .cse63)))) (store .cse70 .cse11 (+ (select (select (store .cse67 |c_ULTIMATE.start_main_~a~0#1.base| .cse70) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse69 .cse11)))))) (store .cse68 .cse10 (+ (select (select (store .cse67 |c_ULTIMATE.start_main_~a~0#1.base| .cse68) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse69 .cse10))))))) (let ((.cse66 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse62 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse64 (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse60 .cse61 .cse62 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 (select (select (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))))))))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (or .cse38 (= .cse0 (let ((.cse89 (store .cse18 .cse55 1))) (let ((.cse87 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse89))) (let ((.cse88 (select .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse75 (select .cse89 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse78 (select .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (select (select (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse76 (select (select (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse83 (store .cse87 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse88 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse75 .cse76 .cse77 .cse78))))) (let ((.cse85 (select .cse83 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse82 (select .cse85 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse80 (store .cse83 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse84 (let ((.cse86 (store .cse85 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse75 .cse76 .cse77 .cse78 .cse82)))) (store .cse86 .cse11 (+ (select (select (store .cse83 |c_ULTIMATE.start_main_~a~0#1.base| .cse86) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse85 .cse11)))))) (store .cse84 .cse10 (+ (select .cse85 .cse10) (select (select (store .cse83 |c_ULTIMATE.start_main_~a~0#1.base| .cse84) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse81 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse74 (select .cse81 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse79 (select (select (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse75 .cse76 .cse77 .cse78 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ .cse74 .cse75 .cse76 .cse77 .cse78 .cse79 (select (select (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse75 .cse76 .cse77 .cse78 .cse79 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse82))))))))))))))) .cse56))))) is different from true [2022-11-25 15:46:27,688 WARN L233 SmtUtils]: Spent 20.68s on a formula simplification. DAG size of input: 304 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 15:47:07,804 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 205 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)