./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b459ef52e6f503a483dfcee5782d400696002c8f6100462cc05f5e2316fe0d4b --- 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-b5237d8 [2022-11-21 13:45:15,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:45:15,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:45:15,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:45:15,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:45:15,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:45:15,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:45:15,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:45:15,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:45:15,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:45:15,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:45:15,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:45:15,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:45:15,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:45:15,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:45:15,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:45:15,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:45:15,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:45:15,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:45:15,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:45:15,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:45:15,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:45:15,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:45:15,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:45:15,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:45:15,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:45:15,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:45:15,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:45:15,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:45:15,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:45:15,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:45:15,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:45:15,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:45:15,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:45:15,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:45:15,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:45:15,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:45:15,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:45:15,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:45:15,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:45:15,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:45:15,635 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-21 13:45:15,673 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:45:15,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:45:15,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:45:15,675 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:45:15,676 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:45:15,676 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:45:15,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:45:15,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:45:15,677 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:45:15,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:45:15,678 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:45:15,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:45:15,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:45:15,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 13:45:15,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:45:15,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 13:45:15,680 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-21 13:45:15,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 13:45:15,680 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:45:15,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 13:45:15,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:45:15,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:45:15,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:45:15,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:45:15,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:45:15,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:45:15,682 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 13:45:15,682 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:45:15,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:45:15,682 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 13:45:15,683 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 13:45:15,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 13:45:15,683 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/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_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b459ef52e6f503a483dfcee5782d400696002c8f6100462cc05f5e2316fe0d4b [2022-11-21 13:45:15,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:45:16,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:45:16,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:45:16,023 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:45:16,023 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:45:16,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i [2022-11-21 13:45:18,924 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:45:19,216 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:45:19,217 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i [2022-11-21 13:45:19,243 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/data/48442b37d/adddf3c2ec41460daa794896ebaf1b6c/FLAG0f4912d91 [2022-11-21 13:45:19,262 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/data/48442b37d/adddf3c2ec41460daa794896ebaf1b6c [2022-11-21 13:45:19,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:45:19,266 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:45:19,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:45:19,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:45:19,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:45:19,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:45:19" (1/1) ... [2022-11-21 13:45:19,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7930b4cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:19, skipping insertion in model container [2022-11-21 13:45:19,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:45:19" (1/1) ... [2022-11-21 13:45:19,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:45:19,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:45:19,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:45:19,694 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:45:19,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:45:19,769 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:45:19,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:19 WrapperNode [2022-11-21 13:45:19,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:45:19,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:45:19,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:45:19,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:45:19,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:19" (1/1) ... [2022-11-21 13:45:19,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:19" (1/1) ... [2022-11-21 13:45:19,834 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2022-11-21 13:45:19,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:45:19,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:45:19,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:45:19,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:45:19,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:19" (1/1) ... [2022-11-21 13:45:19,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:19" (1/1) ... [2022-11-21 13:45:19,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:19" (1/1) ... [2022-11-21 13:45:19,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:19" (1/1) ... [2022-11-21 13:45:19,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:19" (1/1) ... [2022-11-21 13:45:19,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:19" (1/1) ... [2022-11-21 13:45:19,858 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:19" (1/1) ... [2022-11-21 13:45:19,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:19" (1/1) ... [2022-11-21 13:45:19,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:45:19,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:45:19,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:45:19,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:45:19,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:19" (1/1) ... [2022-11-21 13:45:19,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:45:19,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:45:19,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:45:19,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:45:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 13:45:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:45:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:45:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:45:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:45:19,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:45:20,052 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:45:20,054 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:45:20,211 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:45:20,216 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:45:20,216 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 13:45:20,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:45:20 BoogieIcfgContainer [2022-11-21 13:45:20,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:45:20,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:45:20,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:45:20,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:45:20,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:45:19" (1/3) ... [2022-11-21 13:45:20,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f40d1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:45:20, skipping insertion in model container [2022-11-21 13:45:20,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:19" (2/3) ... [2022-11-21 13:45:20,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f40d1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:45:20, skipping insertion in model container [2022-11-21 13:45:20,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:45:20" (3/3) ... [2022-11-21 13:45:20,237 INFO L112 eAbstractionObserver]: Analyzing ICFG b.09-no-inv_assume-alloca.i [2022-11-21 13:45:20,275 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:45:20,275 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-21 13:45:20,343 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:45:20,349 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;@621d0d65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:45:20,349 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-21 13:45:20,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 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-21 13:45:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 13:45:20,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:20,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:20,362 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:45:20,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:20,367 INFO L85 PathProgramCache]: Analyzing trace with hash 123263665, now seen corresponding path program 1 times [2022-11-21 13:45:20,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:20,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442200052] [2022-11-21 13:45:20,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:20,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:20,616 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-21 13:45:20,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:20,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442200052] [2022-11-21 13:45:20,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442200052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:20,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:20,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:45:20,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453067654] [2022-11-21 13:45:20,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:20,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:45:20,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:20,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:45:20,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:45:20,655 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-21 13:45:20,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:20,687 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-11-21 13:45:20,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:45:20,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-11-21 13:45:20,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:20,697 INFO L225 Difference]: With dead ends: 39 [2022-11-21 13:45:20,698 INFO L226 Difference]: Without dead ends: 16 [2022-11-21 13:45:20,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:45:20,704 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:20,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:45:20,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-21 13:45:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-21 13:45:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-11-21 13:45:20,737 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2022-11-21 13:45:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:20,737 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-11-21 13:45:20,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-21 13:45:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-11-21 13:45:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 13:45:20,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:20,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:20,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:45:20,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:45:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash 180521967, now seen corresponding path program 1 times [2022-11-21 13:45:20,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:20,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211891342] [2022-11-21 13:45:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:21,292 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-21 13:45:21,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:21,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211891342] [2022-11-21 13:45:21,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211891342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:21,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:21,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:21,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958208310] [2022-11-21 13:45:21,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:21,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:21,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:21,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:21,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:21,302 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-21 13:45:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:21,410 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-11-21 13:45:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:45:21,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2022-11-21 13:45:21,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:21,411 INFO L225 Difference]: With dead ends: 28 [2022-11-21 13:45:21,411 INFO L226 Difference]: Without dead ends: 27 [2022-11-21 13:45:21,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:45:21,413 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:21,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 25 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:21,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-21 13:45:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2022-11-21 13:45:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 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-21 13:45:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-11-21 13:45:21,418 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 8 [2022-11-21 13:45:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:21,419 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-11-21 13:45:21,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-21 13:45:21,419 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-11-21 13:45:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 13:45:21,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:21,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:21,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:45:21,420 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:45:21,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:21,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1301211949, now seen corresponding path program 1 times [2022-11-21 13:45:21,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:21,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567387518] [2022-11-21 13:45:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:21,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:21,727 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-21 13:45:21,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:21,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567387518] [2022-11-21 13:45:21,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567387518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:21,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:21,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:45:21,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862053515] [2022-11-21 13:45:21,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:21,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:45:21,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:21,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:45:21,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:45:21,741 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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-21 13:45:21,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:21,825 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-11-21 13:45:21,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:45:21,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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 9 [2022-11-21 13:45:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:21,827 INFO L225 Difference]: With dead ends: 27 [2022-11-21 13:45:21,827 INFO L226 Difference]: Without dead ends: 25 [2022-11-21 13:45:21,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:45:21,829 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:21,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 41 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:21,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-21 13:45:21,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-11-21 13:45:21,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) 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-21 13:45:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-21 13:45:21,834 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 9 [2022-11-21 13:45:21,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:21,835 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-21 13:45:21,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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-21 13:45:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-21 13:45:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 13:45:21,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:21,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:21,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:45:21,836 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:45:21,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1301213743, now seen corresponding path program 1 times [2022-11-21 13:45:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:21,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565442410] [2022-11-21 13:45:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:21,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:21,973 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-21 13:45:21,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:21,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565442410] [2022-11-21 13:45:21,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565442410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:21,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:21,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:21,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832197872] [2022-11-21 13:45:21,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:21,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:21,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:21,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:21,977 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-21 13:45:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:22,028 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-11-21 13:45:22,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:45:22,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2022-11-21 13:45:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:22,030 INFO L225 Difference]: With dead ends: 25 [2022-11-21 13:45:22,031 INFO L226 Difference]: Without dead ends: 24 [2022-11-21 13:45:22,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:45:22,032 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:22,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 24 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:45:22,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-21 13:45:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-21 13:45:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 23 states have internal predecessors, (26), 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-21 13:45:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-11-21 13:45:22,037 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 9 [2022-11-21 13:45:22,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:22,037 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-11-21 13:45:22,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-21 13:45:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-11-21 13:45:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 13:45:22,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:22,038 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:22,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:45:22,039 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:45:22,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:22,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1319823166, now seen corresponding path program 1 times [2022-11-21 13:45:22,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:22,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143751863] [2022-11-21 13:45:22,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:22,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:45:22,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:22,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143751863] [2022-11-21 13:45:22,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143751863] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:45:22,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390120640] [2022-11-21 13:45:22,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:22,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:45:22,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:45:22,778 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:45:22,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:45:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:22,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-21 13:45:22,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:23,782 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-21 13:45:23,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 462 treesize of output 894 [2022-11-21 13:45:23,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-11-21 13:45:23,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-21 13:45:24,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-21 13:45:24,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-21 13:45:28,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3508 treesize of output 2822 [2022-11-21 13:45:29,753 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 13 treesize of output 9 [2022-11-21 13:45:30,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:30,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2022-11-21 13:45:33,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:34,235 INFO L321 Elim1Store]: treesize reduction 71, result has 25.3 percent of original size [2022-11-21 13:45:34,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 4242 treesize of output 3866 [2022-11-21 13:45:35,333 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 7 treesize of output 5 [2022-11-21 13:45:35,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:35,355 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 16 treesize of output 14 [2022-11-21 13:45:35,390 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 13:45:35,441 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 13:45:35,443 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 13:45:35,594 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 7 treesize of output 5 [2022-11-21 13:45:36,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:36,624 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 101 treesize of output 5 [2022-11-21 13:45:36,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:36,689 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 101 treesize of output 5 [2022-11-21 13:45:36,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:36,820 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 101 treesize of output 5 [2022-11-21 13:45:36,950 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 346 treesize of output 338 [2022-11-21 13:45:37,103 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 640 treesize of output 626 [2022-11-21 13:45:37,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:37,506 INFO L321 Elim1Store]: treesize reduction 39, result has 40.9 percent of original size [2022-11-21 13:45:37,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 3325 treesize of output 2991 [2022-11-21 13:45:37,844 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 9 treesize of output 7 [2022-11-21 13:45:37,967 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 9 treesize of output 7 [2022-11-21 13:45:38,522 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 9 treesize of output 7 [2022-11-21 13:45:39,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:39,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:39,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:39,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:39,540 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 130 treesize of output 7 [2022-11-21 13:45:39,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:39,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:39,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:39,556 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 127 treesize of output 3 [2022-11-21 13:45:39,563 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 9 treesize of output 7 [2022-11-21 13:45:42,366 INFO L321 Elim1Store]: treesize reduction 42, result has 42.5 percent of original size [2022-11-21 13:45:42,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 872 treesize of output 787 [2022-11-21 13:45:42,443 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 758 treesize of output 754 [2022-11-21 13:45:42,518 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 49 treesize of output 45 [2022-11-21 13:45:42,571 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 49 treesize of output 45 [2022-11-21 13:45:42,590 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 7 treesize of output 5 [2022-11-21 13:45:42,631 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 49 treesize of output 45 [2022-11-21 13:45:42,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:45:42,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-21 13:45:42,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-11-21 13:45:43,082 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-21 13:45:43,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 77 [2022-11-21 13:45:43,138 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 9 treesize of output 7 [2022-11-21 13:45:43,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:45:43,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 22 [2022-11-21 13:45:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:45:43,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:45:43,490 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_159 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_159))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse1) (< .cse1 2147483649))))) is different from false [2022-11-21 13:45:43,516 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_159 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_159))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse0 2147483649) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0))))) is different from false [2022-11-21 13:45:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 13:45:43,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390120640] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:45:43,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:45:43,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-11-21 13:45:43,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716099813] [2022-11-21 13:45:43,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:45:43,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-21 13:45:43,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:43,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-21 13:45:43,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=305, Unknown=9, NotChecked=74, Total=462 [2022-11-21 13:45:43,715 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 states have internal predecessors, (39), 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-21 13:45:43,764 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse6 (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse10 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse12 (not .cse10)) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse32 (<= .cse6 2147483647))) (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (let ((.cse17 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select .cse17 0))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse15)) (.cse11 (<= .cse1 0))) (or (and (or (exists ((v_arrayElimArr_8 (Array Int Int)) (v_prenex_87 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_prenex_88 (Array Int Int))) (let ((.cse3 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8))) (let ((.cse0 (select v_arrayElimArr_8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse5 (select (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse4 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8))) (and (= .cse0 .cse1) (= v_arrayElimArr_8 (store (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse0) 0 (select v_arrayElimArr_8 0))) (= v_DerPreprocessor_28 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= .cse5 2147483647) (= .cse5 .cse6) (= v_prenex_88 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse8 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse9 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (and (= (select v_DerPreprocessor_30 0) .cse1) (= .cse7 .cse6) (= v_prenex_99 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_19 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= .cse7 2147483647) (= .cse2 (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))) .cse10 .cse11) (and .cse12 (exists ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse16 (store (store (store (store (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse15) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17))) (let ((.cse13 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17)) (.cse14 (select (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse2 (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 .cse6) (= (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse15) (<= .cse14 2147483647))))) .cse11) (and (or (exists ((v_arrayElimArr_8 (Array Int Int)) (v_prenex_87 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_prenex_88 (Array Int Int))) (let ((.cse21 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8))) (let ((.cse23 (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse22 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8)) (.cse19 (select v_arrayElimArr_8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse20 (select .cse23 0))) (and (= v_arrayElimArr_8 (store (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse19) 0 (select v_arrayElimArr_8 0))) (= .cse20 .cse1) (= v_DerPreprocessor_28 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse2 (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse6) (<= .cse20 0) (= v_prenex_88 (select .cse22 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse19 .cse20)))))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_41 Int)) (let ((.cse25 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse27 (select .cse24 0)) (.cse26 (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_41) 0 v_DerPreprocessor_42) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse28 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (and (= (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse6) (= v_prenex_99 (select .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse26 .cse27) (= v_DerPreprocessor_19 (select .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse27 (select v_DerPreprocessor_30 0)) (= .cse27 .cse1) (<= .cse27 0) (= v_DerPreprocessor_41 .cse26) (= .cse2 (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))))) .cse10) (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|) .cse11) (let ((.cse29 (select .cse15 0))) (and (<= .cse29 0) (exists ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (let ((.cse30 (store (store (store (store (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse15) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17))) (let ((.cse31 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17))) (and (= .cse15 (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse2 (select .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse15 (select .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) .cse12 (= .cse1 .cse29) (= (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse6))) (and (or (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse32 .cse11) (and (exists ((v_DerPreprocessor_39 Int) (v_DerPreprocessor_40 Int)) (let ((.cse33 (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_39) 0 v_DerPreprocessor_40) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= .cse33 0) (= .cse33 .cse1) (= .cse33 v_DerPreprocessor_39)))) (exists ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse37 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17))) (let ((.cse36 (select .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse34 (select .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse35 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse17))) (and (= .cse34 .cse6) (<= .cse34 2147483647) (= .cse2 (select .cse35 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse15 (select .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse36 .cse15)))))))) .cse12))))) .cse12 (<= (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647) .cse32 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))))) is different from true [2022-11-21 13:45:45,612 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse22 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (select .cse22 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse17 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse11 (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse29 (<= .cse11 2147483647)) (.cse24 (not .cse17)) (.cse23 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse1)) (.cse18 (<= .cse7 0))) (let ((.cse2 (and (or (exists ((v_arrayElimArr_8 (Array Int Int)) (v_prenex_87 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_prenex_88 (Array Int Int))) (let ((.cse39 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8))) (let ((.cse38 (select v_arrayElimArr_8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse41 (select (select .cse39 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse40 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8))) (and (= .cse38 .cse7) (= v_arrayElimArr_8 (store (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse38) 0 (select v_arrayElimArr_8 0))) (= v_DerPreprocessor_28 (select .cse39 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse4 (select .cse40 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= .cse41 2147483647) (= .cse41 .cse11) (= v_prenex_88 (select .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse43 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (let ((.cse42 (select (select .cse43 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse44 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (and (= (select v_DerPreprocessor_30 0) .cse7) (= .cse42 .cse11) (= v_prenex_99 (select .cse43 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_19 (select .cse44 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= .cse42 2147483647) (= .cse4 (select .cse44 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))) .cse17 .cse18)) (.cse3 (and .cse24 (exists ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse37 (store (store (store (store (store .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse1) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22))) (let ((.cse35 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22)) (.cse36 (select (select .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse4 (select .cse35 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse36 .cse11) (= (select .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse1) (<= .cse36 2147483647))))) .cse18)) (.cse25 (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse29 .cse18)) (.cse26 (and (exists ((v_DerPreprocessor_39 Int) (v_DerPreprocessor_40 Int)) (let ((.cse30 (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_39) 0 v_DerPreprocessor_40) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= .cse30 0) (= .cse30 .cse7) (= .cse30 v_DerPreprocessor_39)))) (exists ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse34 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22))) (let ((.cse33 (select .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse31 (select .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse32 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22))) (and (= .cse31 .cse11) (<= .cse31 2147483647) (= .cse4 (select .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse1 (select .cse32 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse33 .cse1))))))))) (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (exists ((|ULTIMATE.start_test_fun_~y_ref~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0))) (and (<= |c_ULTIMATE.start_test_fun_#t~mem10#1| .cse0) (not (<= .cse0 0)) (<= .cse0 2147483647)))) (<= (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) |c_ULTIMATE.start_test_fun_#t~mem9#1|) (or .cse2 .cse3 (and (or (exists ((v_arrayElimArr_8 (Array Int Int)) (v_prenex_87 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_prenex_88 (Array Int Int))) (let ((.cse8 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8))) (let ((.cse10 (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse9 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8)) (.cse5 (select v_arrayElimArr_8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse6 (select .cse10 0))) (and (= v_arrayElimArr_8 (store (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse5) 0 (select v_arrayElimArr_8 0))) (= .cse6 .cse7) (= v_DerPreprocessor_28 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse4 (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse11) (<= .cse6 0) (= v_prenex_88 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse5 .cse6)))))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_41 Int)) (let ((.cse13 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse15 (select .cse12 0)) (.cse14 (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_41) 0 v_DerPreprocessor_42) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse16 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (and (= (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse11) (= v_prenex_99 (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse14 .cse15) (= v_DerPreprocessor_19 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse15 (select v_DerPreprocessor_30 0)) (= .cse15 .cse7) (<= .cse15 0) (= v_DerPreprocessor_41 .cse14) (= .cse4 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))))) .cse17) (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|) .cse18) (let ((.cse19 (select .cse1 0))) (and (<= .cse19 0) (exists ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (let ((.cse20 (store (store (store (store (store .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse1) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22))) (let ((.cse21 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse22))) (and (= .cse1 (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse4 (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse1 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) .cse24 (= .cse7 .cse19) (= (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse11))) (and (or .cse25 .cse26) .cse24)) (forall ((v_ArrVal_159 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| .cse11)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_159))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse27 2147483649) (< (select (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse27))))) (not (<= .cse11 0)) .cse24 (or .cse2 .cse3 .cse25 .cse26) .cse29 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))))) is different from true [2022-11-21 13:45:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:46,355 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-11-21 13:45:46,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 13:45:46,355 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 13:45:46,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:46,356 INFO L225 Difference]: With dead ends: 60 [2022-11-21 13:45:46,356 INFO L226 Difference]: Without dead ends: 59 [2022-11-21 13:45:46,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=193, Invalid=675, Unknown=18, NotChecked=236, Total=1122 [2022-11-21 13:45:46,358 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 99 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 36 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:46,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 101 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 220 Invalid, 10 Unknown, 60 Unchecked, 0.5s Time] [2022-11-21 13:45:46,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-21 13:45:46,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2022-11-21 13:45:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-11-21 13:45:46,365 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 14 [2022-11-21 13:45:46,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:46,366 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-11-21 13:45:46,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 states have internal predecessors, (39), 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-21 13:45:46,366 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-11-21 13:45:46,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 13:45:46,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:46,367 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:46,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 13:45:46,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:45:46,573 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:45:46,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:46,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2035156546, now seen corresponding path program 1 times [2022-11-21 13:45:46,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:46,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450741002] [2022-11-21 13:45:46,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:46,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:45:46,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:46,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450741002] [2022-11-21 13:45:46,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450741002] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:45:46,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82831665] [2022-11-21 13:45:46,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:46,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:45:46,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:45:46,999 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:45:47,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:45:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-21 13:45:47,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:47,722 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-21 13:45:47,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 226 treesize of output 790 [2022-11-21 13:45:47,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-21 13:45:47,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-11-21 13:45:47,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-11-21 13:45:47,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-11-21 13:45:52,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2269 treesize of output 2164 [2022-11-21 13:45:53,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:53,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 5 [2022-11-21 13:45:53,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:53,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 5 [2022-11-21 13:45:54,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:54,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:54,129 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-21 13:45:54,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 755 treesize of output 692 [2022-11-21 13:45:54,174 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 5 treesize of output 3 [2022-11-21 13:45:54,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:54,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:54,580 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-21 13:45:54,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 651 treesize of output 556 [2022-11-21 13:45:54,595 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 519 treesize of output 517 [2022-11-21 13:45:54,608 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 517 treesize of output 515 [2022-11-21 13:45:54,633 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 515 treesize of output 513 [2022-11-21 13:45:55,512 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 27 treesize of output 25 [2022-11-21 13:45:56,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:56,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:56,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:56,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 28 [2022-11-21 13:45:56,259 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 5 treesize of output 3 [2022-11-21 13:45:56,264 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 9 treesize of output 7 [2022-11-21 13:45:56,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:56,383 INFO L321 Elim1Store]: treesize reduction 38, result has 47.2 percent of original size [2022-11-21 13:45:56,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 665 treesize of output 746 [2022-11-21 13:45:56,618 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 5 treesize of output 3 [2022-11-21 13:45:56,683 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 5 treesize of output 3 [2022-11-21 13:45:56,730 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 5 treesize of output 3 [2022-11-21 13:45:57,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:57,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:57,385 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-21 13:45:57,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 33 [2022-11-21 13:45:57,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:57,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:57,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:57,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:45:57,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 12 [2022-11-21 13:46:03,108 INFO L321 Elim1Store]: treesize reduction 46, result has 37.0 percent of original size [2022-11-21 13:46:03,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 3694 treesize of output 3297 [2022-11-21 13:46:03,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:03,907 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 12 treesize of output 10 [2022-11-21 13:46:03,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2022-11-21 13:46:03,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2022-11-21 13:46:04,231 INFO L321 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2022-11-21 13:46:04,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 76 [2022-11-21 13:46:04,276 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 5 treesize of output 3 [2022-11-21 13:46:04,293 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 7 treesize of output 5 [2022-11-21 13:46:04,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 13:46:04,746 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 49 treesize of output 32 [2022-11-21 13:46:04,815 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 28 treesize of output 12 [2022-11-21 13:46:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:04,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:46:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:05,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82831665] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:46:05,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:46:05,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 27 [2022-11-21 13:46:05,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298378643] [2022-11-21 13:46:05,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:46:05,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-21 13:46:05,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:05,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-21 13:46:05,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=549, Unknown=13, NotChecked=0, Total=702 [2022-11-21 13:46:05,846 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 27 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 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-21 13:46:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:07,649 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-11-21 13:46:07,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 13:46:07,650 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 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 15 [2022-11-21 13:46:07,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:07,650 INFO L225 Difference]: With dead ends: 73 [2022-11-21 13:46:07,650 INFO L226 Difference]: Without dead ends: 53 [2022-11-21 13:46:07,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=367, Invalid=1260, Unknown=13, NotChecked=0, Total=1640 [2022-11-21 13:46:07,652 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 241 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:07,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 85 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:46:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-21 13:46:07,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-11-21 13:46:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.3) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-11-21 13:46:07,660 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 15 [2022-11-21 13:46:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:07,660 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-11-21 13:46:07,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 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-21 13:46:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-11-21 13:46:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 13:46:07,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:07,661 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:07,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 13:46:07,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-21 13:46:07,863 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:46:07,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:07,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2035154752, now seen corresponding path program 1 times [2022-11-21 13:46:07,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:07,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385745183] [2022-11-21 13:46:07,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:07,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:08,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:08,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385745183] [2022-11-21 13:46:08,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385745183] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:46:08,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190935206] [2022-11-21 13:46:08,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:08,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:08,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:46:08,169 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:46:08,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 13:46:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:08,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 13:46:08,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:08,376 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 13:46:08,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-21 13:46:08,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:46:08,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:46:08,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:46:08,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:46:08,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:46:08,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:08,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:08,772 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 78 treesize of output 23 [2022-11-21 13:46:08,776 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 9 treesize of output 7 [2022-11-21 13:46:08,779 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 9 treesize of output 7 [2022-11-21 13:46:08,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:08,799 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-21 13:46:08,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 197 [2022-11-21 13:46:08,846 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 7 treesize of output 5 [2022-11-21 13:46:08,866 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 7 treesize of output 5 [2022-11-21 13:46:10,102 INFO L321 Elim1Store]: treesize reduction 54, result has 21.7 percent of original size [2022-11-21 13:46:10,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1136 treesize of output 1093 [2022-11-21 13:46:10,186 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 15 treesize of output 11 [2022-11-21 13:46:10,271 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 15 treesize of output 11 [2022-11-21 13:46:10,412 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 22 treesize of output 16 [2022-11-21 13:46:10,417 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 15 treesize of output 11 [2022-11-21 13:46:10,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2022-11-21 13:46:10,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:46:10,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 1 [2022-11-21 13:46:10,524 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-21 13:46:10,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-21 13:46:10,722 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-21 13:46:10,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 72 [2022-11-21 13:46:10,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:10,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 51 [2022-11-21 13:46:10,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:46:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:10,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:46:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:46:11,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190935206] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:46:11,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:46:11,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2022-11-21 13:46:11,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468760156] [2022-11-21 13:46:11,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:46:11,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-21 13:46:11,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:11,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-21 13:46:11,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=444, Unknown=8, NotChecked=0, Total=552 [2022-11-21 13:46:11,205 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 states have internal predecessors, (41), 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-21 13:46:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:12,844 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-11-21 13:46:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 13:46:12,844 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 states have internal predecessors, (41), 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-21 13:46:12,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:12,845 INFO L225 Difference]: With dead ends: 59 [2022-11-21 13:46:12,845 INFO L226 Difference]: Without dead ends: 58 [2022-11-21 13:46:12,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=248, Invalid=1048, Unknown=36, NotChecked=0, Total=1332 [2022-11-21 13:46:12,848 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 75 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 22 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:12,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 98 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 189 Invalid, 23 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:46:12,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-21 13:46:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2022-11-21 13:46:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.3) internal successors, (65), 53 states have internal predecessors, (65), 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-21 13:46:12,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-11-21 13:46:12,855 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 15 [2022-11-21 13:46:12,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:12,856 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-11-21 13:46:12,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 states have internal predecessors, (41), 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-21 13:46:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-11-21 13:46:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 13:46:12,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:12,857 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:12,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-21 13:46:13,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:13,062 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:46:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:13,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1820880262, now seen corresponding path program 1 times [2022-11-21 13:46:13,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:13,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896563819] [2022-11-21 13:46:13,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:13,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:13,291 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-21 13:46:13,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:13,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896563819] [2022-11-21 13:46:13,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896563819] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:46:13,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117419779] [2022-11-21 13:46:13,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:13,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:13,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:46:13,295 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:46:13,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 13:46:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:13,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-21 13:46:13,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:13,988 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-21 13:46:13,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 226 treesize of output 790 [2022-11-21 13:46:14,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-11-21 13:46:14,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-21 13:46:14,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-21 13:46:14,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-21 13:46:17,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2621 treesize of output 2241 [2022-11-21 13:46:19,260 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 13 treesize of output 9 [2022-11-21 13:46:19,632 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 13 treesize of output 9 [2022-11-21 13:46:19,704 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 13 treesize of output 9 [2022-11-21 13:46:20,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:20,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2022-11-21 13:46:21,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:21,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2022-11-21 13:46:21,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:21,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2022-11-21 13:46:21,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:21,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-11-21 13:46:21,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:21,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-11-21 13:46:21,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 281 [2022-11-21 13:46:21,418 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 7 treesize of output 5 [2022-11-21 13:46:21,470 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 7 treesize of output 5 [2022-11-21 13:46:21,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:21,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2022-11-21 13:46:21,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:21,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:21,731 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-21 13:46:21,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 901 treesize of output 822 [2022-11-21 13:46:21,871 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 9 treesize of output 7 [2022-11-21 13:46:21,974 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 9 treesize of output 7 [2022-11-21 13:46:22,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:46:22,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:46:22,171 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-21 13:46:22,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 632 treesize of output 571 [2022-11-21 13:46:22,185 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 9 treesize of output 7 [2022-11-21 13:46:22,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:22,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:22,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-11-21 13:46:22,397 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 9 treesize of output 7 [2022-11-21 13:46:22,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:22,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:22,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:22,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:22,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 335 treesize of output 296 [2022-11-21 13:46:22,826 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 13:46:22,832 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 13:46:22,839 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 13:46:22,846 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 13:46:22,856 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 13:46:25,428 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 66 treesize of output 25 [2022-11-21 13:46:25,432 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 15 treesize of output 11 [2022-11-21 13:46:41,865 INFO L321 Elim1Store]: treesize reduction 42, result has 39.1 percent of original size [2022-11-21 13:46:41,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 250 treesize of output 237 [2022-11-21 13:46:41,921 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 45 treesize of output 41 [2022-11-21 13:46:41,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2022-11-21 13:46:41,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-21 13:46:42,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:46:42,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2022-11-21 13:46:42,301 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-11-21 13:46:42,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 56 [2022-11-21 13:46:42,305 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 48 treesize of output 44 [2022-11-21 13:46:42,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:46:42,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 36 [2022-11-21 13:46:42,588 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-21 13:46:42,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:46:42,820 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_358 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_358))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse1) (< .cse1 2147483649))))) is different from false [2022-11-21 13:46:42,846 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_358))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse0 2147483649) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0) (not (<= (+ v_ArrVal_356 1) |c_ULTIMATE.start_test_fun_#t~mem12#1|)))))) is different from false [2022-11-21 13:46:42,864 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_358))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse0 2147483649) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0) (< 2147483647 v_ArrVal_356))))) is different from false [2022-11-21 13:46:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-21 13:46:43,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117419779] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:46:43,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:46:43,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2022-11-21 13:46:43,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122186575] [2022-11-21 13:46:43,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:46:43,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-21 13:46:43,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:43,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-21 13:46:43,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=409, Unknown=14, NotChecked=138, Total=702 [2022-11-21 13:46:43,141 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:46:50,218 WARN L233 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 525 DAG size of output: 456 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:46:57,291 WARN L233 SmtUtils]: Spent 5.47s on a formula simplification. DAG size of input: 454 DAG size of output: 451 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:47:13,212 WARN L233 SmtUtils]: Spent 14.28s on a formula simplification. DAG size of input: 526 DAG size of output: 453 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:47:34,821 WARN L233 SmtUtils]: Spent 18.42s on a formula simplification. DAG size of input: 526 DAG size of output: 453 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:47:46,479 WARN L233 SmtUtils]: Spent 10.48s on a formula simplification. DAG size of input: 542 DAG size of output: 457 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:47:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:49,386 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-11-21 13:47:49,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 13:47:49,387 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 13:47:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:49,387 INFO L225 Difference]: With dead ends: 97 [2022-11-21 13:47:49,387 INFO L226 Difference]: Without dead ends: 96 [2022-11-21 13:47:49,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 14 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 77.8s TimeCoverageRelationStatistics Valid=355, Invalid=942, Unknown=47, NotChecked=216, Total=1560 [2022-11-21 13:47:49,389 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 170 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 36 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:49,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 126 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 196 Invalid, 5 Unknown, 76 Unchecked, 1.0s Time] [2022-11-21 13:47:49,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-21 13:47:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2022-11-21 13:47:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.337837837837838) internal successors, (99), 77 states have internal predecessors, (99), 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-21 13:47:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2022-11-21 13:47:49,415 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 16 [2022-11-21 13:47:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:49,416 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2022-11-21 13:47:49,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:47:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2022-11-21 13:47:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 13:47:49,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:49,417 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:49,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 13:47:49,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:49,624 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:47:49,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:49,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1573594942, now seen corresponding path program 1 times [2022-11-21 13:47:49,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:49,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428336686] [2022-11-21 13:47:49,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:49,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:49,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:49,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428336686] [2022-11-21 13:47:49,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428336686] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:49,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5294206] [2022-11-21 13:47:49,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:49,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:49,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:49,899 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:49,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 13:47:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:49,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-21 13:47:49,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:50,149 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 13:47:50,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-21 13:47:50,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:47:50,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:47:50,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:47:50,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:47:50,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:47:50,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:47:50,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 103 treesize of output 92 [2022-11-21 13:47:50,279 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 24 treesize of output 18 [2022-11-21 13:47:50,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:47:50,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:47:50,371 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-21 13:47:50,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 115 treesize of output 110 [2022-11-21 13:47:50,400 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 24 treesize of output 18 [2022-11-21 13:47:50,437 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 24 treesize of output 18 [2022-11-21 13:47:50,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:47:50,508 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 52 treesize of output 15 [2022-11-21 13:47:50,522 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 9 treesize of output 7 [2022-11-21 13:47:51,216 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-11-21 13:47:51,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 428 treesize of output 405 [2022-11-21 13:47:51,249 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 9 treesize of output 7 [2022-11-21 13:47:51,286 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 9 treesize of output 7 [2022-11-21 13:47:51,429 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 28 treesize of output 16 [2022-11-21 13:47:51,494 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 14 treesize of output 16 [2022-11-21 13:47:51,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:47:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:51,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:51,566 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-11-21 13:47:51,587 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_426 (Array Int Int)) (v_ArrVal_425 Int)) (or (not (<= v_ArrVal_425 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-11-21 13:47:51,605 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_426 (Array Int Int)) (v_ArrVal_425 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_425) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) is different from false [2022-11-21 13:47:51,617 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_426 (Array Int Int)) (v_ArrVal_423 (Array Int Int)) (v_ArrVal_425 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_423))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_425))))) is different from false [2022-11-21 13:47:51,656 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_426 (Array Int Int)) (v_ArrVal_423 (Array Int Int)) (v_ArrVal_425 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_423))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_425))))) |c_ULTIMATE.start_test_fun_#t~short7#1|) is different from false [2022-11-21 13:47:51,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-21 13:47:51,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5294206] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:51,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:51,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-11-21 13:47:51,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479247867] [2022-11-21 13:47:51,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:51,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-21 13:47:51,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:51,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-21 13:47:51,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=202, Unknown=8, NotChecked=170, Total=462 [2022-11-21 13:47:51,676 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 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-21 13:47:51,861 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (<= 1 (select .cse0 0)) (forall ((v_ArrVal_426 (Array Int Int)) (v_ArrVal_423 (Array Int Int)) (v_ArrVal_425 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_423))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_425))))) (= .cse3 0) (let ((.cse4 (<= .cse3 0))) (or (and .cse4 (exists ((v_DerPreprocessor_208 (Array Int Int)) (v_DerPreprocessor_207 (Array Int Int))) (and (= .cse3 (select v_DerPreprocessor_208 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) (= .cse0 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_207) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_208) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_207) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_208) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (and .cse4 (exists ((v_DerPreprocessor_213 (Array Int Int)) (v_DerPreprocessor_214 (Array Int Int)) (v_DerPreprocessor_211 (Array Int Int)) (v_DerPreprocessor_212 (Array Int Int)) (v_DerPreprocessor_210 (Array Int Int)) (|ULTIMATE.start_test_fun_~y_ref~0#1.base| Int) (v_DerPreprocessor_209 (Array Int Int))) (let ((.cse9 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_209) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_210) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_211) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_209) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_210) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_211))) (let ((.cse8 (store (store (store (store (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_212) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_213) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_214) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_212) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_213) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_214))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse7 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse5 (select .cse9 |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse5 (select |c_#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse6 v_DerPreprocessor_209) (= .cse6 .cse0) (= v_DerPreprocessor_212 .cse7) (= .cse0 .cse7) (= (select .cse8 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) .cse5) (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (= .cse3 (select v_DerPreprocessor_211 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) (= (select v_DerPreprocessor_214 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) .cse3))))))))))) is different from true [2022-11-21 13:47:52,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:52,198 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-11-21 13:47:52,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 13:47:52,198 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 13:47:52,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:52,200 INFO L225 Difference]: With dead ends: 83 [2022-11-21 13:47:52,200 INFO L226 Difference]: Without dead ends: 82 [2022-11-21 13:47:52,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=323, Unknown=15, NotChecked=270, Total=756 [2022-11-21 13:47:52,201 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:52,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 77 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 127 Invalid, 3 Unknown, 115 Unchecked, 0.1s Time] [2022-11-21 13:47:52,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-21 13:47:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-11-21 13:47:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 77 states have internal predecessors, (98), 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-21 13:47:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2022-11-21 13:47:52,214 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 17 [2022-11-21 13:47:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:52,214 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2022-11-21 13:47:52,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 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-21 13:47:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2022-11-21 13:47:52,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 13:47:52,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:52,216 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:52,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 13:47:52,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:52,421 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:47:52,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:52,422 INFO L85 PathProgramCache]: Analyzing trace with hash -612715006, now seen corresponding path program 2 times [2022-11-21 13:47:52,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:52,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158556417] [2022-11-21 13:47:52,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:52,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:52,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:52,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158556417] [2022-11-21 13:47:52,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158556417] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:47:52,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285745565] [2022-11-21 13:47:52,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:47:52,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:47:52,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:47:52,670 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:47:52,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 13:47:52,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:47:52,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:47:52,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-21 13:47:52,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:47:52,792 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-21 13:47:52,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:47:52,955 INFO L321 Elim1Store]: treesize reduction 78, result has 48.0 percent of original size [2022-11-21 13:47:52,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 234 treesize of output 289 [2022-11-21 13:47:52,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:47:52,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:47:53,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:47:53,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:47:53,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:47:53,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 80 [2022-11-21 13:47:53,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:47:53,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:47:53,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 93 treesize of output 86 [2022-11-21 13:47:53,204 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-21 13:47:53,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 86 [2022-11-21 13:47:53,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 183 [2022-11-21 13:47:53,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:47:53,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-21 13:47:53,931 INFO L321 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2022-11-21 13:47:53,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 40 [2022-11-21 13:47:54,050 INFO L321 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-11-21 13:47:54,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 39 [2022-11-21 13:47:54,053 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 5 treesize of output 3 [2022-11-21 13:47:54,107 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:47:54,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2022-11-21 13:47:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:54,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:47:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:47:54,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285745565] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:47:54,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:47:54,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 25 [2022-11-21 13:47:54,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502633181] [2022-11-21 13:47:54,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:47:54,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 13:47:54,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:54,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 13:47:54,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=499, Unknown=16, NotChecked=0, Total=600 [2022-11-21 13:47:54,649 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:07,184 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2022-11-21 13:48:07,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-21 13:48:07,185 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 13:48:07,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:07,186 INFO L225 Difference]: With dead ends: 113 [2022-11-21 13:48:07,186 INFO L226 Difference]: Without dead ends: 88 [2022-11-21 13:48:07,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=324, Invalid=1608, Unknown=48, NotChecked=0, Total=1980 [2022-11-21 13:48:07,187 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 104 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 39 mSolverCounterUnsat, 59 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 59 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:07,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 104 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 368 Invalid, 59 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 13:48:07,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-21 13:48:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2022-11-21 13:48:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 79 states have internal predecessors, (99), 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-21 13:48:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-11-21 13:48:07,200 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 17 [2022-11-21 13:48:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:07,201 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-11-21 13:48:07,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-11-21 13:48:07,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 13:48:07,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:07,202 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:07,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-21 13:48:07,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 13:48:07,407 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:48:07,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:07,407 INFO L85 PathProgramCache]: Analyzing trace with hash -612713212, now seen corresponding path program 1 times [2022-11-21 13:48:07,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:07,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140721692] [2022-11-21 13:48:07,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:07,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:07,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:07,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140721692] [2022-11-21 13:48:07,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140721692] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:48:07,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989836082] [2022-11-21 13:48:07,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:07,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:48:07,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:48:07,703 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:48:07,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 13:48:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 13:48:07,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:48:07,977 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 13:48:07,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-21 13:48:07,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:48:08,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:48:08,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:48:08,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:08,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:08,586 INFO L321 Elim1Store]: treesize reduction 28, result has 47.2 percent of original size [2022-11-21 13:48:08,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 165 [2022-11-21 13:48:08,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:48:08,645 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 43 treesize of output 14 [2022-11-21 13:48:08,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:48:08,656 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 50 treesize of output 19 [2022-11-21 13:48:08,951 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-21 13:48:08,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 31 [2022-11-21 13:48:09,017 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 21 treesize of output 21 [2022-11-21 13:48:09,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:48:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:09,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:48:09,102 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_559 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_559) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))) is different from false [2022-11-21 13:48:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:09,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989836082] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:48:09,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:48:09,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2022-11-21 13:48:09,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980461219] [2022-11-21 13:48:09,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:48:09,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-21 13:48:09,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:09,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-21 13:48:09,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=370, Unknown=10, NotChecked=42, Total=552 [2022-11-21 13:48:09,404 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:09,698 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_559 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_559) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_558)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_559) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_558 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))) is different from false [2022-11-21 13:48:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:09,759 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-11-21 13:48:09,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 13:48:09,759 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 13:48:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:09,760 INFO L225 Difference]: With dead ends: 83 [2022-11-21 13:48:09,760 INFO L226 Difference]: Without dead ends: 82 [2022-11-21 13:48:09,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=555, Unknown=12, NotChecked=106, Total=870 [2022-11-21 13:48:09,761 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 51 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:09,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 84 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 161 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2022-11-21 13:48:09,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-21 13:48:09,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-21 13:48:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 81 states have internal predecessors, (100), 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-21 13:48:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2022-11-21 13:48:09,777 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 17 [2022-11-21 13:48:09,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:09,777 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2022-11-21 13:48:09,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2022-11-21 13:48:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 13:48:09,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:09,778 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:09,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 13:48:09,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-21 13:48:09,983 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:48:09,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1536802878, now seen corresponding path program 1 times [2022-11-21 13:48:09,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:09,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744834734] [2022-11-21 13:48:09,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:09,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:10,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:10,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744834734] [2022-11-21 13:48:10,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744834734] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:48:10,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923649754] [2022-11-21 13:48:10,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:10,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:48:10,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:48:10,272 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:48:10,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 13:48:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:10,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-21 13:48:10,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:48:10,539 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 13:48:10,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-21 13:48:10,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:48:10,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:48:10,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:48:10,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:10,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:10,662 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-21 13:48:10,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 98 [2022-11-21 13:48:10,685 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 9 treesize of output 7 [2022-11-21 13:48:10,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:10,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:10,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:10,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 85 treesize of output 78 [2022-11-21 13:48:10,761 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 9 treesize of output 7 [2022-11-21 13:48:10,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:10,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:10,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 9 [2022-11-21 13:48:10,809 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 9 treesize of output 7 [2022-11-21 13:48:10,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:48:10,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:10,830 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 52 treesize of output 15 [2022-11-21 13:48:10,835 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 9 treesize of output 7 [2022-11-21 13:48:11,516 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-21 13:48:11,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 769 treesize of output 753 [2022-11-21 13:48:11,733 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 20 treesize of output 14 [2022-11-21 13:48:11,738 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 7 treesize of output 5 [2022-11-21 13:48:11,770 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 5 treesize of output 3 [2022-11-21 13:48:11,780 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 5 treesize of output 3 [2022-11-21 13:48:11,800 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 5 treesize of output 3 [2022-11-21 13:48:11,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:48:11,824 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 11 treesize of output 7 [2022-11-21 13:48:11,893 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-21 13:48:11,958 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 16 treesize of output 18 [2022-11-21 13:48:11,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 13:48:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:12,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:48:12,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:12,135 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-21 13:48:12,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-11-21 13:48:12,145 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 7 treesize of output 5 [2022-11-21 13:48:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:12,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923649754] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:48:12,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:48:12,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-11-21 13:48:12,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586050475] [2022-11-21 13:48:12,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:48:12,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 13:48:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:12,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 13:48:12,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=475, Unknown=13, NotChecked=0, Total=600 [2022-11-21 13:48:12,354 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:12,982 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2022-11-21 13:48:12,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:48:12,983 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-21 13:48:12,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:12,984 INFO L225 Difference]: With dead ends: 82 [2022-11-21 13:48:12,984 INFO L226 Difference]: Without dead ends: 81 [2022-11-21 13:48:12,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=252, Invalid=785, Unknown=19, NotChecked=0, Total=1056 [2022-11-21 13:48:12,985 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 117 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 34 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:12,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 37 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 114 Invalid, 6 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:48:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-21 13:48:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-21 13:48:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 78 states have (on average 1.1923076923076923) internal successors, (93), 80 states have internal predecessors, (93), 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-21 13:48:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2022-11-21 13:48:12,997 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 18 [2022-11-21 13:48:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:12,998 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2022-11-21 13:48:12,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:12,998 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-11-21 13:48:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-21 13:48:12,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:12,999 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:13,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 13:48:13,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:48:13,204 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:48:13,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:13,205 INFO L85 PathProgramCache]: Analyzing trace with hash -93150317, now seen corresponding path program 3 times [2022-11-21 13:48:13,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:13,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590124452] [2022-11-21 13:48:13,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:13,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,587 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-21 13:48:13,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:13,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590124452] [2022-11-21 13:48:13,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590124452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:48:13,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284061259] [2022-11-21 13:48:13,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:48:13,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:48:13,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:48:13,591 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:48:13,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 13:48:13,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-21 13:48:13,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:48:13,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-21 13:48:13,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:48:13,877 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 13:48:13,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-21 13:48:13,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:48:13,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:48:13,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:48:14,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:14,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:14,229 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-21 13:48:14,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 83 [2022-11-21 13:48:14,237 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 9 treesize of output 7 [2022-11-21 13:48:14,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:48:14,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:14,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:14,321 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 85 treesize of output 48 [2022-11-21 13:48:14,326 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 9 treesize of output 7 [2022-11-21 13:48:14,331 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 9 treesize of output 7 [2022-11-21 13:48:14,582 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 13:48:14,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 25 [2022-11-21 13:48:14,586 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 15 treesize of output 11 [2022-11-21 13:48:14,598 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-21 13:48:14,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:48:14,825 INFO L321 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-11-21 13:48:14,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 136 [2022-11-21 13:48:14,849 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 20 treesize of output 14 [2022-11-21 13:48:14,855 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 7 treesize of output 5 [2022-11-21 13:48:14,861 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 5 treesize of output 3 [2022-11-21 13:48:14,870 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 5 treesize of output 3 [2022-11-21 13:48:14,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-21 13:48:15,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-21 13:48:15,262 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:48:15,262 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 1 case distinctions, treesize of input 20 treesize of output 25 [2022-11-21 13:48:15,311 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:48:15,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2022-11-21 13:48:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:48:15,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:48:15,602 INFO L321 Elim1Store]: treesize reduction 36, result has 32.1 percent of original size [2022-11-21 13:48:15,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 44 [2022-11-21 13:48:15,610 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-21 13:48:15,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 63 [2022-11-21 13:48:15,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:15,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2022-11-21 13:48:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 3 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:48:16,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284061259] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:48:16,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:48:16,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2022-11-21 13:48:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909092736] [2022-11-21 13:48:16,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:48:16,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-21 13:48:16,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:16,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-21 13:48:16,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=592, Unknown=11, NotChecked=0, Total=702 [2022-11-21 13:48:16,039 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:33,506 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2022-11-21 13:48:33,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 13:48:33,507 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-21 13:48:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:33,507 INFO L225 Difference]: With dead ends: 97 [2022-11-21 13:48:33,507 INFO L226 Difference]: Without dead ends: 65 [2022-11-21 13:48:33,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=468, Invalid=1683, Unknown=11, NotChecked=0, Total=2162 [2022-11-21 13:48:33,509 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 140 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:33,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 32 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:48:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-21 13:48:33,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 37. [2022-11-21 13:48:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-11-21 13:48:33,519 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 23 [2022-11-21 13:48:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:33,519 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-11-21 13:48:33,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-11-21 13:48:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-21 13:48:33,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:33,520 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:33,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 13:48:33,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-21 13:48:33,726 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:48:33,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:33,726 INFO L85 PathProgramCache]: Analyzing trace with hash 946515818, now seen corresponding path program 1 times [2022-11-21 13:48:33,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:33,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132644836] [2022-11-21 13:48:33,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:33,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:34,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:34,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132644836] [2022-11-21 13:48:34,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132644836] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:48:34,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525995997] [2022-11-21 13:48:34,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:34,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:48:34,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:48:34,331 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:48:34,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 13:48:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:34,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-21 13:48:34,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:48:34,577 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 13:48:34,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-21 13:48:34,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:48:34,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:48:34,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:48:35,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:48:35,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:35,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 55 [2022-11-21 13:48:35,061 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 7 treesize of output 5 [2022-11-21 13:48:35,065 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 15 treesize of output 11 [2022-11-21 13:48:35,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:35,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:35,108 INFO L321 Elim1Store]: treesize reduction 24, result has 25.0 percent of original size [2022-11-21 13:48:35,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 108 [2022-11-21 13:48:35,117 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 7 treesize of output 5 [2022-11-21 13:48:35,138 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 7 treesize of output 5 [2022-11-21 13:48:35,193 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 15 treesize of output 11 [2022-11-21 13:48:35,929 INFO L321 Elim1Store]: treesize reduction 54, result has 21.7 percent of original size [2022-11-21 13:48:35,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 452 treesize of output 429 [2022-11-21 13:48:36,050 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 9 treesize of output 7 [2022-11-21 13:48:36,122 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 9 treesize of output 7 [2022-11-21 13:48:36,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2022-11-21 13:48:36,230 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-21 13:48:36,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-21 13:48:36,501 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-21 13:48:36,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 72 [2022-11-21 13:48:36,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:48:36,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 51 [2022-11-21 13:48:36,833 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 28 treesize of output 16 [2022-11-21 13:48:36,897 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 14 treesize of output 16 [2022-11-21 13:48:36,974 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 28 treesize of output 16 [2022-11-21 13:48:37,036 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 16 treesize of output 18 [2022-11-21 13:48:37,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 13:48:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:37,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:48:41,420 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_786 Int) (v_ArrVal_788 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_785))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_786)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_788) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_786 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))) is different from false [2022-11-21 13:48:41,454 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_786 Int) (v_ArrVal_788 (Array Int Int)) (v_ArrVal_784 Int) (v_ArrVal_785 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_784)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_785))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_786)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_788) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_786 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_784 1))))))) is different from false [2022-11-21 13:48:41,487 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_786 Int) (v_ArrVal_788 (Array Int Int)) (v_ArrVal_784 Int) (v_ArrVal_785 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_784)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_785))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_786)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_788) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_786 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_784 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))) is different from false [2022-11-21 13:48:41,537 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_786 Int) (v_ArrVal_788 (Array Int Int)) (v_ArrVal_784 Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_782))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_784)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_785))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_786)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_788) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_784 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_786 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))) is different from false [2022-11-21 13:48:41,598 WARN L837 $PredicateComparison]: unable to prove that (or (not (< |c_ULTIMATE.start_test_fun_#t~mem10#1| |c_ULTIMATE.start_test_fun_#t~mem9#1|)) (forall ((v_ArrVal_786 Int) (v_ArrVal_788 (Array Int Int)) (v_ArrVal_784 Int) (v_ArrVal_780 Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_780)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_782))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_784)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_785))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_786 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_786)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_788) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) v_ArrVal_780)) (< (+ v_ArrVal_784 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))) is different from false [2022-11-21 13:48:41,926 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2022-11-21 13:48:41,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525995997] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:48:41,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:48:41,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 40 [2022-11-21 13:48:41,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918733208] [2022-11-21 13:48:41,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:48:41,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-21 13:48:41,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:41,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-21 13:48:41,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=984, Unknown=50, NotChecked=360, Total=1640 [2022-11-21 13:48:41,929 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 41 states, 40 states have (on average 2.225) internal successors, (89), 41 states have internal predecessors, (89), 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-21 13:48:43,035 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (<= 1 (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0))) (let ((.cse2 (<= .cse3 0))) (or (and .cse1 .cse2) (and (exists ((v_DerPreprocessor_275 (Array Int Int)) (v_prenex_1451 (Array Int Int)) (v_DerPreprocessor_276 (Array Int Int)) (v_prenex_1453 (Array Int Int)) (v_DerPreprocessor_274 (Array Int Int)) (v_prenex_1452 (Array Int Int))) (let ((.cse6 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_274) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_275) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_276) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_274) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_275) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_276)) (.cse7 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1453) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1451) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_1452) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_1453) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_1451) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_1452))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse5 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= .cse3 (select v_DerPreprocessor_276 0)) (= v_prenex_1453 .cse4) (= (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse4) (= v_DerPreprocessor_274 .cse5) (= .cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse4 .cse5) (= .cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_prenex_1452 0) .cse3))))) .cse2) (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|) .cse2)))) (not .cse1) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from true [2022-11-21 13:48:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:45,936 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-11-21 13:48:45,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 13:48:45,936 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.225) internal successors, (89), 41 states have internal predecessors, (89), 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-21 13:48:45,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:45,937 INFO L225 Difference]: With dead ends: 71 [2022-11-21 13:48:45,937 INFO L226 Difference]: Without dead ends: 70 [2022-11-21 13:48:45,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=433, Invalid=1864, Unknown=79, NotChecked=594, Total=2970 [2022-11-21 13:48:45,939 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 86 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 25 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:45,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 81 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 252 Invalid, 20 Unknown, 133 Unchecked, 0.5s Time] [2022-11-21 13:48:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-21 13:48:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-11-21 13:48:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 68 states have internal predecessors, (71), 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-21 13:48:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2022-11-21 13:48:45,951 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 31 [2022-11-21 13:48:45,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:45,952 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2022-11-21 13:48:45,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.225) internal successors, (89), 41 states have internal predecessors, (89), 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-21 13:48:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-11-21 13:48:45,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-21 13:48:45,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:45,954 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:45,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 13:48:46,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 13:48:46,163 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:48:46,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash -931363604, now seen corresponding path program 4 times [2022-11-21 13:48:46,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:46,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535645608] [2022-11-21 13:48:46,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:46,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:46,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:46,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535645608] [2022-11-21 13:48:46,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535645608] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:48:46,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408468644] [2022-11-21 13:48:46,823 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 13:48:46,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:48:46,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:48:46,827 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:48:46,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 13:48:46,970 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 13:48:46,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:48:46,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-21 13:48:46,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:48:47,198 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 13:48:47,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-21 13:48:47,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:48:47,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:48:47,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:48:47,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:48:47,805 INFO L321 Elim1Store]: treesize reduction 79, result has 27.5 percent of original size [2022-11-21 13:48:47,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 281 treesize of output 319 [2022-11-21 13:48:47,875 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 7 treesize of output 5 [2022-11-21 13:48:47,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:47,949 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 108 treesize of output 11 [2022-11-21 13:48:48,031 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 306 treesize of output 298 [2022-11-21 13:48:48,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 145 [2022-11-21 13:48:48,194 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 22 treesize of output 16 [2022-11-21 13:48:49,649 INFO L321 Elim1Store]: treesize reduction 62, result has 41.5 percent of original size [2022-11-21 13:48:49,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 466 treesize of output 444 [2022-11-21 13:48:49,722 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 15 treesize of output 11 [2022-11-21 13:48:49,762 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 7 treesize of output 5 [2022-11-21 13:48:49,899 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 28 treesize of output 16 [2022-11-21 13:48:49,966 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 14 treesize of output 16 [2022-11-21 13:48:50,034 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 28 treesize of output 16 [2022-11-21 13:48:50,118 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 14 treesize of output 16 [2022-11-21 13:48:50,181 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 28 treesize of output 16 [2022-11-21 13:48:50,259 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 14 treesize of output 16 [2022-11-21 13:48:50,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:48:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:50,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:48:50,426 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_876 Int)) (or (not (<= v_ArrVal_876 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-11-21 13:48:50,443 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876)))) is different from false [2022-11-21 13:48:50,464 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array Int Int)) (v_ArrVal_878 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_875))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2022-11-21 13:48:50,519 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 Int) (v_ArrVal_875 (Array Int Int)) (v_ArrVal_878 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_874)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_875))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_874 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))))))) is different from false [2022-11-21 13:48:50,551 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 Int) (v_ArrVal_875 (Array Int Int)) (v_ArrVal_878 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_874)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_875))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_874) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))) is different from false [2022-11-21 13:48:50,569 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 Int) (v_ArrVal_875 (Array Int Int)) (v_ArrVal_878 (Array Int Int)) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_872))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_874)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_875))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ 1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_874) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876))))))) is different from false [2022-11-21 13:48:50,651 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 Int) (v_ArrVal_875 (Array Int Int)) (v_ArrVal_878 (Array Int Int)) (v_ArrVal_870 Int) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_870)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_872))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_874)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_875))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (not (<= v_ArrVal_870 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_874) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876))))))) is different from false [2022-11-21 13:48:50,699 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 Int) (v_ArrVal_875 (Array Int Int)) (v_ArrVal_878 (Array Int Int)) (v_ArrVal_870 Int) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_870)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_872))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_874)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_875))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_870) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_874) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_876)))))))) is different from false [2022-11-21 13:48:50,739 WARN L837 $PredicateComparison]: unable to prove that (or (not (< |c_ULTIMATE.start_test_fun_#t~mem10#1| |c_ULTIMATE.start_test_fun_#t~mem9#1|)) (forall ((v_ArrVal_874 Int) (v_ArrVal_875 (Array Int Int)) (v_ArrVal_878 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_870 Int) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_869))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_870)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_872))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_874)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_875))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_874) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_870) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ 1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_876)))))))))) is different from false [2022-11-21 13:48:51,013 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_874 Int) (v_ArrVal_875 (Array Int Int)) (v_ArrVal_878 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_870 Int) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_869))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_870)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_872))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_874)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_875))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_874) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_870) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ 1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_876))))))))) (forall ((|ULTIMATE.start_test_fun_~y_ref~0#1.offset| Int)) (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (or (< .cse6 1) (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ .cse6 1)))))) is different from false [2022-11-21 13:48:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 37 not checked. [2022-11-21 13:48:51,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408468644] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:48:51,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:48:51,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 16] total 39 [2022-11-21 13:48:51,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621307114] [2022-11-21 13:48:51,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:48:51,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-21 13:48:51,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:51,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-21 13:48:51,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=663, Unknown=19, NotChecked=650, Total=1560 [2022-11-21 13:48:51,041 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 states have internal predecessors, (96), 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-21 13:48:52,884 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_874 Int) (v_ArrVal_875 (Array Int Int)) (v_ArrVal_878 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_870 Int) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_876 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_869))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_870)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_872))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_874)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_875))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_874) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_870) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_876)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ 1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_876))))))))))) (and (forall ((v_ArrVal_878 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (or .cse0 (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))) (or (not (< |c_ULTIMATE.start_test_fun_#t~mem10#1| |c_ULTIMATE.start_test_fun_#t~mem9#1|)) .cse0))) is different from false [2022-11-21 13:48:52,928 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_878 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (<= |c_ULTIMATE.start_test_fun_#t~mem13#1| 2147483646)) is different from false [2022-11-21 13:48:52,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:52,965 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-11-21 13:48:52,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 13:48:52,966 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 states have internal predecessors, (96), 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-21 13:48:52,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:52,967 INFO L225 Difference]: With dead ends: 89 [2022-11-21 13:48:52,967 INFO L226 Difference]: Without dead ends: 88 [2022-11-21 13:48:52,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 42 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=403, Invalid=1020, Unknown=31, NotChecked=996, Total=2450 [2022-11-21 13:48:52,969 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 151 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 49 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:52,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 64 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 141 Invalid, 17 Unknown, 197 Unchecked, 0.4s Time] [2022-11-21 13:48:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-21 13:48:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2022-11-21 13:48:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-11-21 13:48:52,983 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 33 [2022-11-21 13:48:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:52,984 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-11-21 13:48:52,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 states have internal predecessors, (96), 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-21 13:48:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-11-21 13:48:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-21 13:48:52,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:52,985 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-11-21 13:48:52,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 13:48:53,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:48:53,198 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:48:53,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:53,198 INFO L85 PathProgramCache]: Analyzing trace with hash 693789614, now seen corresponding path program 2 times [2022-11-21 13:48:53,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:53,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446080266] [2022-11-21 13:48:53,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:53,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:53,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:53,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446080266] [2022-11-21 13:48:53,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446080266] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:48:53,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613646894] [2022-11-21 13:48:53,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:48:53,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:48:53,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:48:53,987 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:48:54,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 13:48:54,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:48:54,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:48:54,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-21 13:48:54,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:48:54,341 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 13:48:54,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-21 13:48:54,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:48:54,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:48:54,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:48:54,893 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-21 13:48:54,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 79 [2022-11-21 13:48:55,167 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-21 13:48:55,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 31 [2022-11-21 13:48:55,242 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 21 treesize of output 21 [2022-11-21 13:48:55,359 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 28 treesize of output 16 [2022-11-21 13:48:55,418 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 16 treesize of output 18 [2022-11-21 13:48:55,502 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 30 treesize of output 18 [2022-11-21 13:48:55,557 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 16 treesize of output 18 [2022-11-21 13:48:55,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 13:48:55,604 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:55,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:48:55,662 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_963 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))) is different from false [2022-11-21 13:48:55,831 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_960))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_962)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_962 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))) is different from false [2022-11-21 13:48:55,867 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_959 Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_959)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_960))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_962)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_962 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_959 1))))))) is different from false [2022-11-21 13:48:55,899 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_959 Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_959)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_960))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_962)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_959 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_962 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))) is different from false [2022-11-21 13:48:55,946 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_959 Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_957))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_959)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_960))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_959 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_962)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_962 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))) is different from false [2022-11-21 13:48:56,005 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_959 Int) (v_ArrVal_955 Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_955)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_957))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_959)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_960))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_959 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_962 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_955 1))) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_962)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))) is different from false [2022-11-21 13:48:56,055 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_959 Int) (v_ArrVal_955 Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_955)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_957))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_959)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_960))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_955 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_959 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_962 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_962)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))))))) is different from false [2022-11-21 13:48:56,085 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_959 Int) (v_ArrVal_955 Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_955)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_957))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_959)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_960))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_955 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_959 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_962 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_962)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))))))) (= |c_ULTIMATE.start_test_fun_#t~mem8#1| 0)) is different from false [2022-11-21 13:48:56,116 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_959 Int) (v_ArrVal_955 Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_955)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_957))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_959)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_960))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_955 1) .cse0) (< (+ v_ArrVal_959 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_962 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_962)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))) (= .cse0 0)))) is different from false [2022-11-21 13:48:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 34 not checked. [2022-11-21 13:48:56,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613646894] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:48:56,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:48:56,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 15] total 41 [2022-11-21 13:48:56,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455426376] [2022-11-21 13:48:56,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:48:56,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-21 13:48:56,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:56,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-21 13:48:56,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=807, Unknown=15, NotChecked=630, Total=1722 [2022-11-21 13:48:56,262 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 42 states, 41 states have (on average 2.317073170731707) internal successors, (95), 42 states have internal predecessors, (95), 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-21 13:48:57,106 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_963 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))) (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int))) (or (< (+ v_ArrVal_962 1) .cse0) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_962)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))) (or (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_959 Int) (v_ArrVal_955 Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_955)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_957))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_959)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_960))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_955 1) .cse0) (< (+ v_ArrVal_959 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_962 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_962)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))) (= .cse0 0) |c_ULTIMATE.start_test_fun_#t~short7#1|)))) is different from false [2022-11-21 13:48:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:57,169 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-11-21 13:48:57,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 13:48:57,170 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.317073170731707) internal successors, (95), 42 states have internal predecessors, (95), 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-21 13:48:57,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:57,171 INFO L225 Difference]: With dead ends: 86 [2022-11-21 13:48:57,171 INFO L226 Difference]: Without dead ends: 85 [2022-11-21 13:48:57,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=367, Invalid=1216, Unknown=17, NotChecked=850, Total=2450 [2022-11-21 13:48:57,173 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 70 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:57,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 110 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 200 Invalid, 0 Unknown, 169 Unchecked, 0.3s Time] [2022-11-21 13:48:57,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-21 13:48:57,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2022-11-21 13:48:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:48:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-11-21 13:48:57,185 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 33 [2022-11-21 13:48:57,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:57,186 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-11-21 13:48:57,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.317073170731707) internal successors, (95), 42 states have internal predecessors, (95), 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-21 13:48:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-11-21 13:48:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-21 13:48:57,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:57,188 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:57,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-21 13:48:57,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 13:48:57,394 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:48:57,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:57,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2144651796, now seen corresponding path program 2 times [2022-11-21 13:48:57,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:57,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697589509] [2022-11-21 13:48:57,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:57,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:58,497 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:58,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:58,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697589509] [2022-11-21 13:48:58,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697589509] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:48:58,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95610521] [2022-11-21 13:48:58,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:48:58,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:48:58,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:48:58,503 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:48:58,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 13:48:58,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:48:58,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:48:58,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-21 13:48:58,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:48:58,669 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 14 treesize of output 12 [2022-11-21 13:48:58,777 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 13:48:58,777 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 1 case distinctions, treesize of input 26 treesize of output 29 [2022-11-21 13:48:58,800 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 14 treesize of output 16 [2022-11-21 13:48:58,860 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 28 treesize of output 16 [2022-11-21 13:48:58,876 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 14 treesize of output 16 [2022-11-21 13:48:58,945 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 28 treesize of output 16 [2022-11-21 13:48:58,968 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 16 treesize of output 18 [2022-11-21 13:48:59,031 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 30 treesize of output 18 [2022-11-21 13:48:59,048 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 16 treesize of output 18 [2022-11-21 13:48:59,113 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 30 treesize of output 18 [2022-11-21 13:48:59,131 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 16 treesize of output 18 [2022-11-21 13:48:59,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 13:48:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:59,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:49:03,350 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1064 Int) (v_ArrVal_1066 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1064)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1064 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))) is different from false [2022-11-21 13:49:03,377 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1064 Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1063))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1064 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1064)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))) is different from false [2022-11-21 13:49:03,412 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1061 Int) (v_ArrVal_1064 Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1061)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1063))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1061 1))) (< (+ v_ArrVal_1064 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1064)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))) is different from false [2022-11-21 13:49:03,442 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1061 Int) (v_ArrVal_1064 Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1061)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1063))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1064 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1064)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1061 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))) is different from false [2022-11-21 13:49:03,494 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1061 Int) (v_ArrVal_1064 Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1060))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1061)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1063))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1061 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1064 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1064)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))) is different from false [2022-11-21 13:49:03,561 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1061 Int) (v_ArrVal_1064 Int) (v_ArrVal_1059 Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1059)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1060))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1061)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1063))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1064)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1059 1))) (< (+ v_ArrVal_1061 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1064 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))) is different from false [2022-11-21 13:49:03,615 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1061 Int) (v_ArrVal_1064 Int) (v_ArrVal_1059 Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1059)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1060))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1061)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1063))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1059 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1064)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1061 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1064 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))) is different from false [2022-11-21 13:49:03,688 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1061 Int) (v_ArrVal_1064 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1059 Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1057))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1059)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1060))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1061)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1063))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1064 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1064)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1061 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1059 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))) is different from false [2022-11-21 13:49:03,771 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1061 Int) (v_ArrVal_1064 Int) (v_ArrVal_1055 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1059 Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1055)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1057))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1059)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1060))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1061)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1063))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1055 1))) (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1064)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1059 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1061 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1064 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))) is different from false [2022-11-21 13:49:03,833 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1061 Int) (v_ArrVal_1064 Int) (v_ArrVal_1055 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1059 Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1055)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1057))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1059)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1060))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1061)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1063))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1055 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1064)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1059 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1061 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1064 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))))) is different from false [2022-11-21 13:49:03,927 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1061 Int) (v_ArrVal_1064 Int) (v_ArrVal_1055 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1059 Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1054 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1054))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1055)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1057))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1059)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1060))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1061)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1063))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1059 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ 2147483648 (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1064)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (< (+ v_ArrVal_1064 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1061 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1055 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false [2022-11-21 13:49:04,034 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1061 Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_1064 Int) (v_ArrVal_1052 Int) (v_ArrVal_1055 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1059 Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1054 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1052)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1054))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1055)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1057))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1059)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1060))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1061)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1063))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1055 1) (select .cse0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1064 1) (select .cse1 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) v_ArrVal_1052)) (< (+ v_ArrVal_1059 1) (select .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1064)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1061 1) (select .cse4 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false [2022-11-21 13:49:04,166 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1061 Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_1064 Int) (v_ArrVal_1052 Int) (v_ArrVal_1055 Int) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1059 Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1054 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1052)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1054))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1055)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1057))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1059)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1060))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1061)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1063))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1055 1) (select .cse0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1064 1) (select .cse1 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) v_ArrVal_1052)) (< (+ v_ArrVal_1059 1) (select .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1064)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1061 1) (select .cse4 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) |c_ULTIMATE.start_test_fun_#t~short7#1|) is different from false [2022-11-21 13:49:04,212 INFO L321 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-11-21 13:49:04,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 688 treesize of output 458 [2022-11-21 13:49:04,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:49:04,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 968 treesize of output 967 [2022-11-21 13:49:04,271 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 54 treesize of output 50 [2022-11-21 13:49:04,289 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 118 treesize of output 110 [2022-11-21 13:49:04,306 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 502 treesize of output 470 [2022-11-21 13:49:04,323 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 11 treesize of output 9 [2022-11-21 13:49:04,340 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 246 treesize of output 230 [2022-11-21 13:49:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 93 not checked. [2022-11-21 13:49:04,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95610521] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:49:04,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:49:04,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 19] total 45 [2022-11-21 13:49:04,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876346671] [2022-11-21 13:49:04,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:49:04,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-21 13:49:04,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:04,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-21 13:49:04,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=813, Unknown=20, NotChecked=962, Total=2070 [2022-11-21 13:49:04,463 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 46 states, 45 states have (on average 2.5555555555555554) internal successors, (115), 46 states have internal predecessors, (115), 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-21 13:49:07,332 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1066 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1066) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))) (<= 0 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 2147483647))) is different from false [2022-11-21 13:49:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:49:07,344 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2022-11-21 13:49:07,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-21 13:49:07,345 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.5555555555555554) internal successors, (115), 46 states have internal predecessors, (115), 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 47 [2022-11-21 13:49:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:49:07,346 INFO L225 Difference]: With dead ends: 113 [2022-11-21 13:49:07,346 INFO L226 Difference]: Without dead ends: 112 [2022-11-21 13:49:07,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 74 SyntacticMatches, 17 SemanticMatches, 49 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=344, Invalid=1021, Unknown=23, NotChecked=1162, Total=2550 [2022-11-21 13:49:07,348 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 92 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 28 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:49:07,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 101 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 234 Invalid, 6 Unknown, 530 Unchecked, 0.3s Time] [2022-11-21 13:49:07,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-21 13:49:07,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 101. [2022-11-21 13:49:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 100 states have internal predecessors, (103), 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-21 13:49:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2022-11-21 13:49:07,361 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 47 [2022-11-21 13:49:07,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:49:07,361 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2022-11-21 13:49:07,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.5555555555555554) internal successors, (115), 46 states have internal predecessors, (115), 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-21 13:49:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2022-11-21 13:49:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-21 13:49:07,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:49:07,370 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:07,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-21 13:49:07,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 13:49:07,575 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-21 13:49:07,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:07,576 INFO L85 PathProgramCache]: Analyzing trace with hash -573924074, now seen corresponding path program 5 times [2022-11-21 13:49:07,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:07,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657762123] [2022-11-21 13:49:07,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:07,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:08,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:08,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657762123] [2022-11-21 13:49:08,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657762123] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:49:08,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890141187] [2022-11-21 13:49:08,381 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 13:49:08,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:08,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:49:08,384 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:49:08,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d3c694-1e79-4fd6-b900-299ba3954734/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-21 13:49:08,548 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-21 13:49:08,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:49:08,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-21 13:49:08,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:49:08,706 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-21 13:49:08,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-21 13:49:08,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-21 13:49:08,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:49:08,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-21 13:49:09,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:09,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:49:09,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:49:09,143 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 60 treesize of output 21 [2022-11-21 13:49:09,147 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 9 treesize of output 7 [2022-11-21 13:49:09,151 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 9 treesize of output 7 [2022-11-21 13:49:09,214 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-21 13:49:09,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 114 [2022-11-21 13:49:09,222 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 22 treesize of output 16 [2022-11-21 13:49:09,227 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 13:49:09,233 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 7 treesize of output 5 [2022-11-21 13:49:09,251 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 15 treesize of output 11 [2022-11-21 13:49:09,382 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:49:09,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-21 13:49:09,391 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 5 treesize of output 3 [2022-11-21 13:49:09,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-11-21 13:49:09,736 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 13:49:09,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 42 [2022-11-21 13:49:09,957 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 13:49:09,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 13:49:10,202 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 13:49:10,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 13:49:10,407 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 13:49:10,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 13:49:10,672 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 13:49:10,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 13:49:10,868 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 13:49:10,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 13:49:11,130 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 13:49:11,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 13:49:11,336 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 13:49:11,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 13:49:11,572 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-21 13:49:11,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2022-11-21 13:49:11,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:49:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:11,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:18,430 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1165 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1166 Int) (v_ArrVal_1168 Int) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1163))) (let ((.cse9 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1165)))) (let ((.cse7 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (let ((.cse6 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1168)))) (let ((.cse1 (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse8 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse2 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse4 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse3 (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse5 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse0 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_1165) (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1170 1)) (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1168) (< (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1166 1)) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1165) (< (select (select (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))))))))))))) is different from false [2022-11-21 13:55:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 84 refuted. 6 times theorem prover too weak. 0 trivial. 15 not checked. [2022-11-21 13:55:21,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890141187] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:21,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:55:21,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25, 25] total 63 [2022-11-21 13:55:21,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101607721] [2022-11-21 13:55:21,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:21,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-21 13:55:21,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:55:21,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-21 13:55:21,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=665, Invalid=3136, Unknown=109, NotChecked=122, Total=4032 [2022-11-21 13:55:21,349 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand has 64 states, 63 states have (on average 2.2857142857142856) internal successors, (144), 64 states have internal predecessors, (144), 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-21 13:55:24,810 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= .cse0 0) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1165 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1166 Int) (v_ArrVal_1168 Int) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1163))) (let ((.cse10 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1165)))) (let ((.cse8 (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (let ((.cse7 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1168)))) (let ((.cse2 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse9 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse3 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse5 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse4 (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse6 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse1 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_1165) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1170 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1168) (< (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1166 1)) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1165) (< (select (select (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))))))))))))) (not (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (= .cse0 0) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from false [2022-11-21 13:55:28,221 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= .cse0 0) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1165 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1166 Int) (v_ArrVal_1168 Int) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1163))) (let ((.cse10 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1165)))) (let ((.cse8 (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (let ((.cse7 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1168)))) (let ((.cse2 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse9 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse3 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse5 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse4 (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse6 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse1 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_1165) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1170 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1168) (< (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1166 1)) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1165) (< (select (select (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))))))))))))) (= .cse0 0) (or (not (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from false [2022-11-21 13:55:31,678 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= .cse0 0) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1165 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1166 Int) (v_ArrVal_1168 Int) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1163))) (let ((.cse10 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1165)))) (let ((.cse8 (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (let ((.cse7 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1168)))) (let ((.cse2 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse9 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse3 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse5 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse4 (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse6 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse1 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 2147483647 v_ArrVal_1165) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1170 1)) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1168) (< (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1166 1)) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1165) (< (select (select (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))))))))))))) (or (not .cse21) (and (= |c_ULTIMATE.start_test_fun_#t~mem8#1| 0) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (or .cse21 (= .cse0 0)) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from false [2022-11-21 13:55:37,558 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse28 (+ (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1))) (and (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1166 Int) (v_ArrVal_1168 Int) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (let ((.cse6 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1168)))) (let ((.cse8 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse2 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse5 (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse4 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse7 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse1 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< .cse0 (+ v_ArrVal_1166 1)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1168) (< (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1170 1)) (< (select (select (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))))))))) (<= (select .cse18 0) 2147483646) (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1180 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse21 (select .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse23 (select .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse23 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse20 (select .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse19 (select .cse22 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (not (<= (+ v_ArrVal_1175 1) |c_ULTIMATE.start_test_fun_#t~mem12#1|)) (< (+ (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (+ (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select (select (store .cse22 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse23 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)))))))))))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1180 Int)) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse27 (select .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse36 (store .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse29 (select .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse35 (store .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse31 (select .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse34 (store .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse32 (select .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse33 (store .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse30 (select .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< .cse28 v_ArrVal_1172) (< (+ (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (select .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (+ (select .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (select (select (store .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1168 Int) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1168)))) (let ((.cse44 (select .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse50 (store .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse44 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse40 (select .cse50 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse49 (store .cse50 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse45 (select .cse49 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse48 (store .cse49 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse45 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse41 (select .cse48 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse47 (store .cse48 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse38 (select .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse46 (store .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse43 (select .cse46 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse42 (store .cse46 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse39 (select .cse42 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (select .cse39 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (+ (select .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172) (< .cse28 v_ArrVal_1168) (< (+ (select .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select (select (store .cse42 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse39 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (select .cse44 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1170 1)) (< (select .cse45 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)))))))))))))))))) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1180 Int)) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse54 (select .cse59 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse58 (store .cse59 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse54 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse56 (select .cse58 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse57 (store .cse58 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse56 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse53 (select .cse57 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse55 (store .cse57 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse53 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse52 (select .cse55 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (+ (select .cse53 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< .cse0 (+ v_ArrVal_1175 1)) (< (+ (select .cse54 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select (select (store .cse55 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse56 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)))))))))))) (forall ((v_ArrVal_1182 Int)) (or (not (<= (+ v_ArrVal_1182 1) |c_ULTIMATE.start_test_fun_#t~mem12#1|)) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse71 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse65 (select .cse71 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse70 (store .cse71 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse65 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse64 (select .cse70 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse69 (store .cse70 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse64 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse62 (select .cse69 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse68 (store .cse69 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse62 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse61 (select .cse68 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse67 (store .cse68 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse61 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse66 (select .cse67 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse63 (store .cse67 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse66 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse60 (select .cse63 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse60 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (not (<= (+ v_ArrVal_1170 1) |c_ULTIMATE.start_test_fun_#t~mem12#1|)) (< (select .cse61 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (+ (select .cse62 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select (select (store .cse63 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse60 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse64 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< (+ (select .cse65 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172) (< (+ 1 (select .cse66 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1180))))))))))))))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse77 (select .cse83 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse82 (store .cse83 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse77 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse76 (select .cse82 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse81 (store .cse82 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse76 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse74 (select .cse81 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse80 (store .cse81 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse74 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse73 (select .cse80 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse79 (store .cse80 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse73 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse78 (select .cse79 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse75 (store .cse79 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse78 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse72 (select .cse75 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse72 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (select .cse73 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (+ (select .cse74 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< .cse0 (+ v_ArrVal_1170 1)) (< (select (select (store .cse75 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse72 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse76 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< (+ (select .cse77 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172) (< (+ 1 (select .cse78 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1180))))))))))))))) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1180 Int)) (let ((.cse85 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse84 (select .cse85 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< .cse28 v_ArrVal_1180) (< (select .cse84 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (select (select (store .cse85 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse84 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1166 Int) (v_ArrVal_1168 Int) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse101 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (let ((.cse91 (select .cse101 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse100 (store .cse101 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse91 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1168)))) (let ((.cse93 (select .cse100 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse99 (store .cse100 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse93 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse87 (select .cse99 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse98 (store .cse99 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse87 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse90 (select .cse98 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse97 (store .cse98 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse90 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse89 (select .cse97 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse96 (store .cse97 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse89 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse92 (select .cse96 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse95 (store .cse96 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse92 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse86 (select .cse95 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse94 (store .cse95 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse86 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse88 (select .cse94 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ (select .cse86 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (+ (select .cse87 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172) (< (select .cse88 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (+ (select .cse89 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (not (<= (+ v_ArrVal_1166 1) |c_ULTIMATE.start_test_fun_#t~mem12#1|)) (< (select .cse90 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< (+ (select .cse91 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1168) (< (select .cse92 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (select .cse93 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1170 1)) (< (select (select (store .cse94 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse88 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))))))))) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1178 Int) (v_ArrVal_1180 Int)) (let ((.cse105 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse104 (select .cse105 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse102 (store .cse105 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse104 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse103 (select .cse102 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store .cse102 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse103 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse104 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (not (<= (+ v_ArrVal_1178 1) |c_ULTIMATE.start_test_fun_#t~mem12#1|)) (< (select .cse103 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)))))))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1165 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1166 Int) (v_ArrVal_1168 Int) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse123 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1165)))) (let ((.cse110 (select .cse123 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse122 (store .cse123 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse110 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (let ((.cse114 (select .cse122 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse121 (store .cse122 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse114 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1168)))) (let ((.cse113 (select .cse121 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse120 (store .cse121 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse113 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse115 (select .cse120 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse119 (store .cse120 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse115 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse109 (select .cse119 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse118 (store .cse119 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse109 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse112 (select .cse118 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse117 (store .cse118 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse112 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse108 (select .cse117 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse116 (store .cse117 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse108 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse111 (select .cse116 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse106 (store .cse116 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse111 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse107 (select .cse106 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store .cse106 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse107 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< 2147483647 v_ArrVal_1165) (< (select .cse108 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (select .cse109 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< (select .cse110 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1166 1)) (< .cse28 v_ArrVal_1165) (< (+ (select .cse111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (+ (select .cse112 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select .cse113 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1170 1)) (< (+ (select .cse114 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1168) (< (select .cse107 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (+ (select .cse115 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172))))))))))))))))))))) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1178 Int) (v_ArrVal_1180 Int)) (let ((.cse129 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse126 (select .cse129 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse128 (store .cse129 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse126 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse127 (select .cse128 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse124 (store .cse128 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse127 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse125 (select .cse124 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store .cse124 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse125 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse126 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (+ (select .cse127 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (select .cse125 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< .cse28 v_ArrVal_1176)))))))))))) is different from true [2022-11-21 13:56:27,550 WARN L233 SmtUtils]: Spent 9.54s on a formula simplification that was a NOOP. DAG size: 174 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:56:30,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:56:32,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:56:34,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:56:36,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:56:39,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:56:41,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:56:43,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:56:45,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:56:47,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:56:49,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:56:51,970 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1166 Int) (v_ArrVal_1168 Int) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (let ((.cse6 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1168)))) (let ((.cse8 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse2 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse5 (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse4 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse7 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse1 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< .cse0 (+ v_ArrVal_1166 1)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172) (< (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1168) (< (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1170 1)) (< (select (select (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))))))))) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1180 Int)) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse20 (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse22 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse19 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse21 (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (not (<= (+ v_ArrVal_1175 1) |c_ULTIMATE.start_test_fun_#t~mem12#1|)) (< (+ (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (+ (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select (select (store .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse22 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)))))))))))) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1180 Int)) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse28 (select .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse32 (store .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse30 (select .cse32 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse27 (select .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse29 (store .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse26 (select .cse29 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (+ (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< .cse0 (+ v_ArrVal_1175 1)) (< (+ (select .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select (select (store .cse29 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)))))))))))) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1178 Int) (v_ArrVal_1180 Int)) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse36 (select .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse34 (store .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store .cse34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< .cse0 (+ v_ArrVal_1178 1)) (< (select .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)))))))) (forall ((v_ArrVal_1182 Int)) (or (not (<= (+ v_ArrVal_1182 1) |c_ULTIMATE.start_test_fun_#t~mem12#1|)) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse43 (select .cse49 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse48 (store .cse49 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse42 (select .cse48 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse47 (store .cse48 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse42 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse40 (select .cse47 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse46 (store .cse47 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse39 (select .cse46 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse45 (store .cse46 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse39 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse41 (store .cse45 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse44 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse38 (select .cse41 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (not (<= (+ v_ArrVal_1170 1) |c_ULTIMATE.start_test_fun_#t~mem12#1|)) (< (select .cse39 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (+ (select .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select (select (store .cse41 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse42 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< (+ (select .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172) (< (+ 1 (select .cse44 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1180))))))))))))))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse55 (select .cse61 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse60 (store .cse61 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse55 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse54 (select .cse60 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse59 (store .cse60 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse54 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse52 (select .cse59 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse58 (store .cse59 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse52 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse51 (select .cse58 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse57 (store .cse58 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse56 (select .cse57 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse53 (store .cse57 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse56 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse50 (select .cse53 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse50 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (select .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (+ (select .cse52 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< .cse0 (+ v_ArrVal_1170 1)) (< (select (select (store .cse53 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse50 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse54 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< (+ (select .cse55 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172) (< (+ 1 (select .cse56 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1180))))))))))))))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1166 Int) (v_ArrVal_1168 Int) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse77 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1166)))) (let ((.cse67 (select .cse77 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse76 (store .cse77 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse67 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1168)))) (let ((.cse69 (select .cse76 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse75 (store .cse76 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse69 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse63 (select .cse75 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse63 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse66 (select .cse74 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse73 (store .cse74 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse66 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse65 (select .cse73 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse72 (store .cse73 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse65 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse68 (select .cse72 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse71 (store .cse72 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse68 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse62 (select .cse71 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse70 (store .cse71 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse62 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse64 (select .cse70 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ (select .cse62 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (+ (select .cse63 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172) (< (select .cse64 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (+ (select .cse65 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (not (<= (+ v_ArrVal_1166 1) |c_ULTIMATE.start_test_fun_#t~mem12#1|)) (< (select .cse66 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< (+ (select .cse67 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1168) (< (select .cse68 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (select .cse69 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1170 1)) (< (select (select (store .cse70 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse64 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))))))))) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1178 Int) (v_ArrVal_1180 Int)) (let ((.cse81 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse80 (select .cse81 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse78 (store .cse81 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse80 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse79 (select .cse78 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store .cse78 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse79 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse80 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (not (<= (+ v_ArrVal_1178 1) |c_ULTIMATE.start_test_fun_#t~mem12#1|)) (< (select .cse79 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)))))))) (forall ((v_ArrVal_1182 Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< .cse0 (+ v_ArrVal_1182 1))))))) is different from true [2022-11-21 13:57:28,896 WARN L233 SmtUtils]: Spent 9.60s on a formula simplification that was a NOOP. DAG size: 179 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:57:30,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:57:32,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:57:34,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:57:36,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:57:38,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:57:40,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:57:42,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:57:44,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:58:29,216 WARN L233 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 173 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:58:31,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:58:33,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:58:35,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=false, quantifiers [1] [2022-11-21 13:58:37,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:58:38,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:58:40,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:58:42,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:58:45,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:58:47,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:58:49,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:58:51,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:58:53,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:58:55,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:58:57,973 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1)) (.cse21 (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1))) (and (forall ((v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1178 Int) (v_ArrVal_1180 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (not (<= v_ArrVal_1176 .cse4)) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)))))))))) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1180 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= v_ArrVal_1180 .cse4)) (< (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (select (select (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1180 Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse10 (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse11 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse12 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= v_ArrVal_1172 .cse4)) (< (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (+ (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (select (select (store .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1180 Int)) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse20 (select .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse22 (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse28 (store .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse24 (select .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse25 (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse23 (select .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< .cse21 v_ArrVal_1172) (< (+ (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select .cse23 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (+ (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (select (select (store .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse23 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1168 Int) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1168)))) (let ((.cse37 (select .cse44 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse43 (store .cse44 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse33 (select .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse42 (store .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse38 (select .cse42 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse41 (store .cse42 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse34 (select .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse40 (store .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse31 (select .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse39 (store .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse36 (select .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse35 (store .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse32 (select .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (select .cse32 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (+ (select .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172) (< .cse21 v_ArrVal_1168) (< (+ (select .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select (select (store .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse32 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (select .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1170 1)) (< (select .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)))))))))))))))))) (forall ((v_ArrVal_1172 Int) (v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1168 Int) (v_ArrVal_1170 Int) (v_ArrVal_1180 Int)) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1168)))) (let ((.cse51 (select .cse58 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse57 (store .cse58 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1170)))) (let ((.cse47 (select .cse57 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse56 (store .cse57 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse47 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1172)))) (let ((.cse52 (select .cse56 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse55 (store .cse56 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse48 (select .cse55 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse54 (store .cse55 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse48 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse45 (select .cse54 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse53 (store .cse54 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse45 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse50 (select .cse53 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse49 (store .cse53 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse50 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse46 (select .cse49 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse45 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (select .cse46 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (+ (select .cse47 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1172) (< (+ (select .cse48 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select (select (store .cse49 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse46 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse50 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (select .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1170 1)) (< (select .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (not (<= v_ArrVal_1168 .cse4)))))))))))))))))) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1175 Int) (v_ArrVal_1178 Int) (v_ArrVal_1180 Int)) (let ((.cse61 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse61 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1175)))) (let ((.cse62 (select .cse67 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse66 (store .cse67 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse62 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse64 (select .cse66 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse65 (store .cse66 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse64 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse60 (select .cse65 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse63 (store .cse65 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse60 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse59 (select .cse63 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse59 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (+ (select .cse60 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (select .cse61 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1175 1)) (< (+ (select .cse62 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1176) (< (select (select (store .cse63 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse59 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse64 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1))))))))))))) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1180 Int)) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse68 (select .cse69 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< .cse21 v_ArrVal_1180) (< (select .cse68 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< (select (select (store .cse69 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse68 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (<= |c_ULTIMATE.start_test_fun_#t~mem13#1| 2147483646) (forall ((v_ArrVal_1182 Int) (v_ArrVal_1176 Int) (v_ArrVal_1178 Int) (v_ArrVal_1180 Int)) (let ((.cse75 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1176)))) (let ((.cse72 (select .cse75 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse72 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1178)))) (let ((.cse73 (select .cse74 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse70 (store .cse74 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse73 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1180)))) (let ((.cse71 (select .cse70 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select (select (store .cse70 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse71 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1182)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse72 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1178 1)) (< (+ (select .cse73 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1180) (< (select .cse71 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1182 1)) (< .cse21 v_ArrVal_1176)))))))))))) is different from true [2022-11-21 13:59:26,076 WARN L233 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 145 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:59:27,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:59:29,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:59:31,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:59:33,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:59:35,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:59:37,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:59:39,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:59:42,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]