./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/mods.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/mods.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba --- 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-2329fc7 [2022-12-13 17:41:46,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:41:46,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:41:46,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:41:46,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:41:46,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:41:46,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:41:46,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:41:46,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:41:46,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:41:46,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:41:46,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:41:46,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:41:46,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:41:46,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:41:46,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:41:46,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:41:46,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:41:46,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:41:46,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:41:46,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:41:46,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:41:46,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:41:46,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:41:46,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:41:46,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:41:46,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:41:46,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:41:46,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:41:46,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:41:46,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:41:46,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:41:46,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:41:46,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:41:46,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:41:46,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:41:46,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:41:46,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:41:46,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:41:46,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:41:46,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:41:46,455 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 17:41:46,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:41:46,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:41:46,470 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:41:46,470 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:41:46,471 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:41:46,471 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:41:46,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:41:46,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:41:46,472 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:41:46,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:41:46,472 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:41:46,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:41:46,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:41:46,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:41:46,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:41:46,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:41:46,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:41:46,473 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:41:46,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:41:46,473 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:41:46,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:41:46,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:41:46,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:41:46,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:41:46,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:41:46,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:41:46,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:41:46,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:41:46,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:41:46,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:41:46,475 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:41:46,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:41:46,475 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:41:46,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:41:46,475 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:41:46,476 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/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_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba [2022-12-13 17:41:46,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:41:46,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:41:46,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:41:46,675 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:41:46,675 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:41:46,676 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/array-fpi/mods.c [2022-12-13 17:41:49,150 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:41:49,302 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:41:49,302 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/sv-benchmarks/c/array-fpi/mods.c [2022-12-13 17:41:49,306 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/data/35bc9b22d/a542c5da4736499b85d704b07e67fde9/FLAG0737df174 [2022-12-13 17:41:49,713 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/data/35bc9b22d/a542c5da4736499b85d704b07e67fde9 [2022-12-13 17:41:49,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:41:49,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:41:49,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:41:49,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:41:49,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:41:49,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:41:49" (1/1) ... [2022-12-13 17:41:49,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@407faf59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:49, skipping insertion in model container [2022-12-13 17:41:49,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:41:49" (1/1) ... [2022-12-13 17:41:49,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:41:49,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:41:49,860 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/sv-benchmarks/c/array-fpi/mods.c[587,600] [2022-12-13 17:41:49,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:41:49,887 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:41:49,899 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/sv-benchmarks/c/array-fpi/mods.c[587,600] [2022-12-13 17:41:49,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:41:49,920 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:41:49,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:49 WrapperNode [2022-12-13 17:41:49,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:41:49,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:41:49,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:41:49,922 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:41:49,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:49" (1/1) ... [2022-12-13 17:41:49,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:49" (1/1) ... [2022-12-13 17:41:49,949 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2022-12-13 17:41:49,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:41:49,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:41:49,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:41:49,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:41:49,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:49" (1/1) ... [2022-12-13 17:41:49,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:49" (1/1) ... [2022-12-13 17:41:49,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:49" (1/1) ... [2022-12-13 17:41:49,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:49" (1/1) ... [2022-12-13 17:41:49,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:49" (1/1) ... [2022-12-13 17:41:49,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:49" (1/1) ... [2022-12-13 17:41:49,968 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:49" (1/1) ... [2022-12-13 17:41:49,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:49" (1/1) ... [2022-12-13 17:41:49,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:41:49,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:41:49,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:41:49,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:41:49,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:49" (1/1) ... [2022-12-13 17:41:49,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:41:49,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:49,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:49,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:41:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:41:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:41:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 17:41:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 17:41:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 17:41:50,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:41:50,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:41:50,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 17:41:50,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 17:41:50,084 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:41:50,085 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:41:50,216 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:41:50,222 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:41:50,222 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-13 17:41:50,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:41:50 BoogieIcfgContainer [2022-12-13 17:41:50,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:41:50,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:41:50,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:41:50,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:41:50,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:41:49" (1/3) ... [2022-12-13 17:41:50,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e5d239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:41:50, skipping insertion in model container [2022-12-13 17:41:50,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:49" (2/3) ... [2022-12-13 17:41:50,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e5d239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:41:50, skipping insertion in model container [2022-12-13 17:41:50,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:41:50" (3/3) ... [2022-12-13 17:41:50,233 INFO L112 eAbstractionObserver]: Analyzing ICFG mods.c [2022-12-13 17:41:50,250 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:41:50,250 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 17:41:50,285 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:41:50,291 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;@61032a84, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:41:50,292 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 17:41:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 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-12-13 17:41:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 17:41:50,299 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:50,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:50,300 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:41:50,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:50,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-12-13 17:41:50,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:50,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545596587] [2022-12-13 17:41:50,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:50,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:50,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:50,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545596587] [2022-12-13 17:41:50,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545596587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:50,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:50,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:41:50,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676513124] [2022-12-13 17:41:50,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:50,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 17:41:50,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:50,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 17:41:50,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 17:41:50,455 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 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) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:41:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:50,467 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-12-13 17:41:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 17:41:50,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-13 17:41:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:50,474 INFO L225 Difference]: With dead ends: 50 [2022-12-13 17:41:50,475 INFO L226 Difference]: Without dead ends: 23 [2022-12-13 17:41:50,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 17:41:50,479 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:50,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 17:41:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-12-13 17:41:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-12-13 17:41:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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-12-13 17:41:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-12-13 17:41:50,503 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-12-13 17:41:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:50,503 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-12-13 17:41:50,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:41:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-12-13 17:41:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 17:41:50,504 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:50,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:50,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:41:50,505 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:41:50,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-12-13 17:41:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:50,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722372197] [2022-12-13 17:41:50,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:50,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:50,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-12-13 17:41:50,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:50,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722372197] [2022-12-13 17:41:50,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722372197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:50,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:50,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:50,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979012441] [2022-12-13 17:41:50,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:50,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:41:50,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:50,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:41:50,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:41:50,620 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:41:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:50,691 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-12-13 17:41:50,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:41:50,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-13 17:41:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:50,692 INFO L225 Difference]: With dead ends: 53 [2022-12-13 17:41:50,692 INFO L226 Difference]: Without dead ends: 37 [2022-12-13 17:41:50,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:41:50,694 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:50,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-12-13 17:41:50,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-12-13 17:41:50,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-12-13 17:41:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-12-13 17:41:50,703 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-12-13 17:41:50,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:50,703 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-12-13 17:41:50,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:41:50,704 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-12-13 17:41:50,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 17:41:50,705 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:50,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:50,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:41:50,705 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:41:50,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:50,707 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-12-13 17:41:50,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:50,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314048014] [2022-12-13 17:41:50,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:50,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:50,742 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 17:41:50,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077977193] [2022-12-13 17:41:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:50,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:41:50,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:50,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:41:50,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 17:41:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:50,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-13 17:41:50,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:50,934 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-12-13 17:41:50,943 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-12-13 17:41:50,973 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 19 treesize of output 18 [2022-12-13 17:41:51,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-12-13 17:41:51,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-12-13 17:41:51,261 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 84 treesize of output 51 [2022-12-13 17:41:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:51,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:41:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:51,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:51,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314048014] [2022-12-13 17:41:51,985 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 17:41:51,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077977193] [2022-12-13 17:41:51,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077977193] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:41:51,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:41:51,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2022-12-13 17:41:51,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255527897] [2022-12-13 17:41:51,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:41:51,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 17:41:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:51,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 17:41:51,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2022-12-13 17:41:51,989 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 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-12-13 17:41:54,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:54,240 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-12-13 17:41:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 17:41:54,240 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 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 24 [2022-12-13 17:41:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:54,241 INFO L225 Difference]: With dead ends: 81 [2022-12-13 17:41:54,241 INFO L226 Difference]: Without dead ends: 79 [2022-12-13 17:41:54,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=381, Invalid=2069, Unknown=0, NotChecked=0, Total=2450 [2022-12-13 17:41:54,243 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 171 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:54,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 183 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 17:41:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-13 17:41:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 44. [2022-12-13 17:41:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:41:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-12-13 17:41:54,250 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 24 [2022-12-13 17:41:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:54,250 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-12-13 17:41:54,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 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-12-13 17:41:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-12-13 17:41:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 17:41:54,251 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:54,252 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:54,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:54,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:41:54,453 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:41:54,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:54,455 INFO L85 PathProgramCache]: Analyzing trace with hash 775449632, now seen corresponding path program 2 times [2022-12-13 17:41:54,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:54,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130104447] [2022-12-13 17:41:54,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:54,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:54,500 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 17:41:54,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820421252] [2022-12-13 17:41:54,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:41:54,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:41:54,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:54,502 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:41:54,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 17:41:54,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:41:54,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:41:54,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 17:41:54,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:41:54,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:41:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 17:41:54,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:54,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130104447] [2022-12-13 17:41:54,621 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 17:41:54,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820421252] [2022-12-13 17:41:54,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820421252] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:41:54,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:41:54,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-12-13 17:41:54,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694607547] [2022-12-13 17:41:54,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:41:54,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:41:54,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:54,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:41:54,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:41:54,623 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-12-13 17:41:54,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:54,751 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-12-13 17:41:54,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:41:54,752 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-13 17:41:54,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:54,753 INFO L225 Difference]: With dead ends: 108 [2022-12-13 17:41:54,753 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 17:41:54,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-12-13 17:41:54,755 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 76 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:54,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 63 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 17:41:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 58. [2022-12-13 17:41:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 57 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:41:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2022-12-13 17:41:54,764 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 26 [2022-12-13 17:41:54,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:54,764 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2022-12-13 17:41:54,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-12-13 17:41:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2022-12-13 17:41:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 17:41:54,765 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:54,765 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:54,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 17:41:54,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:41:54,966 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:41:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:54,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1411307230, now seen corresponding path program 3 times [2022-12-13 17:41:54,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:54,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773944611] [2022-12-13 17:41:54,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:54,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:54,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 17:41:54,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120227611] [2022-12-13 17:41:54,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 17:41:54,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:41:54,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:54,992 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:41:54,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 17:41:55,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 17:41:55,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:41:55,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 17:41:55,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 17:41:55,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:41:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 17:41:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:55,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773944611] [2022-12-13 17:41:55,166 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 17:41:55,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120227611] [2022-12-13 17:41:55,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120227611] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:41:55,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:41:55,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-12-13 17:41:55,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970616073] [2022-12-13 17:41:55,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:41:55,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:41:55,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:55,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:41:55,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:41:55,168 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-12-13 17:41:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:55,296 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2022-12-13 17:41:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:41:55,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 28 [2022-12-13 17:41:55,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:41:55,297 INFO L225 Difference]: With dead ends: 101 [2022-12-13 17:41:55,297 INFO L226 Difference]: Without dead ends: 51 [2022-12-13 17:41:55,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-13 17:41:55,298 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:41:55,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 53 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:41:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-13 17:41:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2022-12-13 17:41:55,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 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-12-13 17:41:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-12-13 17:41:55,302 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2022-12-13 17:41:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:41:55,302 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-12-13 17:41:55,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-12-13 17:41:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-12-13 17:41:55,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 17:41:55,304 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:41:55,304 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:55,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 17:41:55,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:41:55,505 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:41:55,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:55,505 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2022-12-13 17:41:55,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:55,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042711769] [2022-12-13 17:41:55,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:55,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:55,545 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 17:41:55,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1232054074] [2022-12-13 17:41:55,546 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 17:41:55,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:41:55,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:55,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:41:55,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 17:41:55,669 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 17:41:55,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:41:55,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-13 17:41:55,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:55,681 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-12-13 17:41:55,686 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-12-13 17:41:55,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 17:41:55,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-12-13 17:41:55,910 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-12-13 17:41:55,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 53 [2022-12-13 17:41:55,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:41:55,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:41:56,000 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-12-13 17:41:56,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 60 [2022-12-13 17:41:56,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:41:56,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:41:56,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:41:56,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:41:56,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:41:56,237 INFO L321 Elim1Store]: treesize reduction 48, result has 22.6 percent of original size [2022-12-13 17:41:56,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 72 treesize of output 81 [2022-12-13 17:41:56,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:41:56,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:41:56,360 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-13 17:41:56,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 55 [2022-12-13 17:41:56,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:41:56,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:41:56,580 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-12-13 17:41:56,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 309 treesize of output 157 [2022-12-13 17:41:56,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:41:56,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:41:56,710 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 17:41:56,710 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 39 treesize of output 44 [2022-12-13 17:41:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:56,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:42:05,245 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< |ULTIMATE.start_main_~i~0#1| 0) (< 0 |ULTIMATE.start_main_~i~0#1|) (= (let ((.cse10 (let ((.cse11 (* |ULTIMATE.start_main_~i~0#1| 8))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse11 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse1 (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (+ .cse5 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse6 .cse7))) (mod .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0))) (store .cse2 .cse3 (+ (select .cse4 .cse3) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))))))) 0))) is different from false [2022-12-13 17:42:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 17:42:05,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:05,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042711769] [2022-12-13 17:42:05,259 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 17:42:05,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232054074] [2022-12-13 17:42:05,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232054074] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:42:05,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:42:05,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-12-13 17:42:05,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577104618] [2022-12-13 17:42:05,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:42:05,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-13 17:42:05,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:05,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-13 17:42:05,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1718, Unknown=1, NotChecked=86, Total=2070 [2022-12-13 17:42:05,261 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 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-12-13 17:42:32,756 WARN L233 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:42:45,080 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:43:08,291 WARN L233 SmtUtils]: Spent 9.10s on a formula simplification that was a NOOP. DAG size: 118 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:43:13,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-12-13 17:43:14,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-12-13 17:43:16,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-12-13 17:43:19,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2022-12-13 17:43:33,722 WARN L233 SmtUtils]: Spent 8.85s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:43:58,039 WARN L233 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:44:51,160 WARN L233 SmtUtils]: Spent 27.81s on a formula simplification. DAG size of input: 178 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:45:43,322 WARN L233 SmtUtils]: Spent 29.56s on a formula simplification. DAG size of input: 166 DAG size of output: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:46:03,723 WARN L233 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 115 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:46:39,225 WARN L233 SmtUtils]: Spent 8.90s on a formula simplification. DAG size of input: 114 DAG size of output: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:47:16,527 WARN L233 SmtUtils]: Spent 30.40s on a formula simplification. DAG size of input: 143 DAG size of output: 134 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:47:19,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-12-13 17:47:23,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-12-13 17:47:30,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-12-13 17:47:31,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-12-13 17:47:50,578 WARN L233 SmtUtils]: Spent 12.84s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:48:00,855 WARN L233 SmtUtils]: Spent 6.84s on a formula simplification. DAG size of input: 103 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:48:26,357 WARN L233 SmtUtils]: Spent 11.70s on a formula simplification. DAG size of input: 118 DAG size of output: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:48:51,092 WARN L233 SmtUtils]: Spent 7.16s on a formula simplification. DAG size of input: 117 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:49:02,654 WARN L233 SmtUtils]: Spent 7.13s on a formula simplification. DAG size of input: 120 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:49:11,675 WARN L233 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 104 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:49:20,382 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 107 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:49:56,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:49:56,232 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2022-12-13 17:49:56,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-12-13 17:49:56,232 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-13 17:49:56,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:49:56,233 INFO L225 Difference]: With dead ends: 133 [2022-12-13 17:49:56,233 INFO L226 Difference]: Without dead ends: 131 [2022-12-13 17:49:56,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3384 ImplicationChecksByTransitivity, 410.5s TimeCoverageRelationStatistics Valid=1305, Invalid=10907, Unknown=2, NotChecked=218, Total=12432 [2022-12-13 17:49:56,236 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 337 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 173 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 68.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:49:56,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 291 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 785 Invalid, 3 Unknown, 83 Unchecked, 68.9s Time] [2022-12-13 17:49:56,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-12-13 17:49:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 56. [2022-12-13 17:49:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 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-12-13 17:49:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-12-13 17:49:56,247 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 32 [2022-12-13 17:49:56,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:49:56,247 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-12-13 17:49:56,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 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-12-13 17:49:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-12-13 17:49:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 17:49:56,248 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:49:56,248 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:49:56,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 17:49:56,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:49:56,450 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:49:56,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:49:56,451 INFO L85 PathProgramCache]: Analyzing trace with hash 332676504, now seen corresponding path program 5 times [2022-12-13 17:49:56,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:49:56,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289347823] [2022-12-13 17:49:56,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:49:56,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:49:56,497 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 17:49:56,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8366019] [2022-12-13 17:49:56,497 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 17:49:56,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:49:56,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:49:56,499 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:49:56,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 17:49:56,627 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 17:49:56,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:49:56,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 17:49:56,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:49:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 17:49:56,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:49:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 17:49:56,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:49:56,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289347823] [2022-12-13 17:49:56,704 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 17:49:56,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8366019] [2022-12-13 17:49:56,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8366019] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:49:56,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:49:56,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-12-13 17:49:56,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804674022] [2022-12-13 17:49:56,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:49:56,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 17:49:56,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:49:56,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 17:49:56,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 17:49:56,706 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:49:56,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:49:56,880 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2022-12-13 17:49:56,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 17:49:56,880 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-13 17:49:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:49:56,881 INFO L225 Difference]: With dead ends: 142 [2022-12-13 17:49:56,881 INFO L226 Difference]: Without dead ends: 105 [2022-12-13 17:49:56,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-12-13 17:49:56,882 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 146 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:49:56,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 59 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:49:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-13 17:49:56,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2022-12-13 17:49:56,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.131578947368421) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:49:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-12-13 17:49:56,901 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 34 [2022-12-13 17:49:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:49:56,901 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-12-13 17:49:56,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:49:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-12-13 17:49:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 17:49:56,902 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:49:56,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:49:56,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 17:49:57,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 17:49:57,104 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:49:57,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:49:57,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2022-12-13 17:49:57,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:49:57,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094440135] [2022-12-13 17:49:57,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:49:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:49:57,157 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 17:49:57,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591425750] [2022-12-13 17:49:57,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:49:57,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:49:57,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:49:57,159 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:49:57,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6459bce-a755-4623-be93-ceb663ea4b18/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 17:49:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:57,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-13 17:49:57,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:49:57,246 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-12-13 17:49:57,249 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-12-13 17:49:57,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 17:49:57,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:49:57,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 17:49:57,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:49:57,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:49:57,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-12-13 17:49:57,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:49:57,430 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 0 case distinctions, treesize of input 50 treesize of output 38 [2022-12-13 17:49:57,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:49:57,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:49:57,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2022-12-13 17:49:57,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:49:57,580 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 0 case distinctions, treesize of input 63 treesize of output 39 [2022-12-13 17:49:57,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:49:57,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:49:57,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 145 [2022-12-13 17:49:57,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:49:57,812 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 0 case distinctions, treesize of input 156 treesize of output 84 [2022-12-13 17:49:58,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 38 [2022-12-13 17:49:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:49:58,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:51:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:51:14,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:51:14,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094440135] [2022-12-13 17:51:14,577 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 17:51:14,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591425750] [2022-12-13 17:51:14,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591425750] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:51:14,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:51:14,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2022-12-13 17:51:14,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536573898] [2022-12-13 17:51:14,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:51:14,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-13 17:51:14,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:51:14,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-13 17:51:14,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1530, Unknown=21, NotChecked=0, Total=1892 [2022-12-13 17:51:14,579 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 44 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 44 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:52:54,258 WARN L233 SmtUtils]: Spent 1.09m on a formula simplification. DAG size of input: 162 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:52:59,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:53:01,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-12-13 17:53:03,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:53:05,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=true, quantifiers [1] [2022-12-13 17:53:14,315 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 136 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:53:22,368 WARN L233 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 140 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:53:28,763 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse92 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse36 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse21 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse88 (+ .cse92 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse91 (select .cse21 .cse88)) (.cse89 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse24 (+ .cse89 1)) (.cse32 (+ .cse89 .cse91)) (.cse26 (+ .cse92 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse23 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse27 (select .cse21 .cse26)) (.cse13 (store .cse21 .cse88 .cse32)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse90 (mod .cse91 .cse24))) (let ((.cse0 (store .cse21 .cse88 .cse90)) (.cse20 (select .cse21 .cse1)) (.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse42 (+ .cse89 .cse27)) (.cse18 (+ .cse89 .cse23)) (.cse3 (store .cse21 .cse88 1)) (.cse39 (= .cse90 0)) (.cse38 (< .cse91 0))) (and (or (= (select .cse0 .cse1) 0) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse11 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse9 (+ v_ArrVal_301 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| .cse9))) (let ((.cse5 (+ (select .cse11 .cse1) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse7 (store .cse10 .cse1 .cse5))) (let ((.cse8 (mod .cse9 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (<= (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_298)) (not (<= (+ v_ArrVal_298 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) v_ArrVal_301)) (= (mod .cse5 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse8 0))))))))))))) (let ((.cse12 (mod (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse14 1)))) (or (not (= .cse12 0)) (= (mod (select .cse13 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| .cse12)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse19 (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| .cse18))) (let ((.cse15 (+ .cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse16 (store .cse19 .cse1 .cse15))) (let ((.cse17 (mod .cse18 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= 0 (mod .cse15 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (not (= .cse17 0))))))) (let ((.cse22 (mod .cse23 .cse24))) (or (not (= .cse22 0)) (= (mod .cse20 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| .cse22)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse25 (store .cse21 .cse26 (mod .cse27 .cse24)))) (or (not (= (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse25 .cse1) 0))) (forall ((v_ArrVal_301 Int)) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse35 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse33 (+ v_ArrVal_301 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse34 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| .cse33))) (let ((.cse28 (+ (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse35 .cse1)))) (let ((.cse30 (store .cse34 .cse1 .cse28))) (let ((.cse31 (mod .cse33 (+ (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse28 (+ 1 (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 0) (not (= .cse31 0)) (not (<= .cse32 v_ArrVal_301))))))))))) (let ((.cse37 (store .cse0 .cse26 (mod .cse27 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (or (= (select .cse37 .cse1) 0) (not (= (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (and .cse38 (not .cse39)))) (or (not (= 0 .cse23)) (= .cse20 0)) (let ((.cse41 (store .cse21 .cse26 .cse42))) (let ((.cse40 (mod (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse41) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse40 0)) (= (mod (select .cse41 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| .cse40)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))) (let ((.cse43 (store .cse13 .cse26 (+ .cse27 .cse14)))) (let ((.cse44 (mod (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod (select .cse43 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~a~0#1.offset| .cse44)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse44 0))))) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse49 (store .cse21 .cse26 1))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse49))) (let ((.cse50 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse47 (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse54 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse52 (+ v_ArrVal_301 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse53 (store .cse54 |c_ULTIMATE.start_main_~a~0#1.offset| .cse52))) (let ((.cse46 (+ (select (select (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| .cse53) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse54 .cse1)))) (let ((.cse48 (store .cse53 .cse1 .cse46))) (let ((.cse45 (mod .cse52 (+ (select (select (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| .cse48) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse45 0)) (= (mod .cse46 (+ (select (select (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| .cse45)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (<= (+ (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_298)) (not (<= (+ v_ArrVal_298 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) v_ArrVal_301)))))))))))))) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse61 (select .cse56 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse59 (+ v_ArrVal_301 (select .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse60 (store .cse61 |c_ULTIMATE.start_main_~a~0#1.offset| .cse59))) (let ((.cse55 (+ (select (select (store .cse56 |c_ULTIMATE.start_main_~a~0#1.base| .cse60) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse61 .cse1)))) (let ((.cse57 (store .cse60 .cse1 .cse55))) (let ((.cse58 (mod .cse59 (+ (select (select (store .cse56 |c_ULTIMATE.start_main_~a~0#1.base| .cse57) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse55 (+ 1 (select (select (store .cse56 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~a~0#1.offset| .cse58)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 0) (not (<= .cse32 v_ArrVal_298)) (not (= .cse58 0)) (not (<= (+ v_ArrVal_298 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26)) v_ArrVal_301))))))))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (forall ((v_ArrVal_301 Int)) (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse68 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse66 (+ v_ArrVal_301 (select .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse67 (store .cse68 |c_ULTIMATE.start_main_~a~0#1.offset| .cse66))) (let ((.cse62 (+ (select (select (store .cse63 |c_ULTIMATE.start_main_~a~0#1.base| .cse67) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse68 .cse1)))) (let ((.cse64 (store .cse67 .cse1 .cse62))) (let ((.cse65 (mod .cse66 (+ (select (select (store .cse63 |c_ULTIMATE.start_main_~a~0#1.base| .cse64) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse62 (+ 1 (select (select (store .cse63 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~a~0#1.offset| .cse65)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 0) (not (<= .cse42 v_ArrVal_301)) (not (= .cse65 0))))))))))) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse70 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse75 (select .cse70 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse73 (+ v_ArrVal_301 (select .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_main_~a~0#1.offset| .cse73))) (let ((.cse69 (+ (select (select (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| .cse74) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse75 .cse1)))) (let ((.cse71 (store .cse74 .cse1 .cse69))) (let ((.cse72 (mod .cse73 (+ (select (select (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| .cse71) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse69 (+ 1 (select (select (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~a~0#1.offset| .cse72)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 0) (not (= .cse72 0)) (not (<= .cse18 v_ArrVal_298)) (not (<= (+ v_ArrVal_298 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) v_ArrVal_301))))))))))) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse77 (store .cse3 .cse26 1))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse77))) (let ((.cse76 (select .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse80 (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse85 (select .cse80 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse83 (+ v_ArrVal_301 (select .cse85 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse84 (store .cse85 |c_ULTIMATE.start_main_~a~0#1.offset| .cse83))) (let ((.cse79 (+ (select .cse85 .cse1) (select (select (store .cse80 |c_ULTIMATE.start_main_~a~0#1.base| .cse84) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse81 (store .cse84 .cse1 .cse79))) (let ((.cse82 (mod .cse83 (+ (select (select (store .cse80 |c_ULTIMATE.start_main_~a~0#1.base| .cse81) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (<= (+ (select .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse77 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_298)) (not (<= (+ (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_298) v_ArrVal_301)) (= (mod .cse79 (+ (select (select (store .cse80 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse81 |c_ULTIMATE.start_main_~a~0#1.offset| .cse82)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse82 0)))))))))))))) (let ((.cse86 (let ((.cse87 (store .cse21 .cse88 (+ .cse89 .cse90 1)))) (store .cse87 .cse26 (mod .cse27 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse87) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))) (or .cse39 (= (select .cse86 .cse1) 0) (not .cse38) (not (= (select .cse86 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))))))) is different from false [2022-12-13 17:53:30,777 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse92 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse36 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse21 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse88 (+ .cse92 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse91 (select .cse21 .cse88)) (.cse89 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse24 (+ .cse89 1)) (.cse32 (+ .cse89 .cse91)) (.cse26 (+ .cse92 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse23 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse27 (select .cse21 .cse26)) (.cse13 (store .cse21 .cse88 .cse32)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse90 (mod .cse91 .cse24))) (let ((.cse0 (store .cse21 .cse88 .cse90)) (.cse20 (select .cse21 .cse1)) (.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse42 (+ .cse89 .cse27)) (.cse18 (+ .cse89 .cse23)) (.cse3 (store .cse21 .cse88 1)) (.cse39 (= .cse90 0)) (.cse38 (< .cse91 0))) (and (or (= (select .cse0 .cse1) 0) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse11 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse9 (+ v_ArrVal_301 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| .cse9))) (let ((.cse5 (+ (select .cse11 .cse1) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse7 (store .cse10 .cse1 .cse5))) (let ((.cse8 (mod .cse9 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (<= (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_298)) (not (<= (+ v_ArrVal_298 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) v_ArrVal_301)) (= (mod .cse5 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse8 0))))))))))))) (let ((.cse12 (mod (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse14 1)))) (or (not (= .cse12 0)) (= (mod (select .cse13 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| .cse12)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse19 (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| .cse18))) (let ((.cse15 (+ .cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse16 (store .cse19 .cse1 .cse15))) (let ((.cse17 (mod .cse18 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= 0 (mod .cse15 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (not (= .cse17 0))))))) (let ((.cse22 (mod .cse23 .cse24))) (or (not (= .cse22 0)) (= (mod .cse20 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| .cse22)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse25 (store .cse21 .cse26 (mod .cse27 .cse24)))) (or (not (= (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse25 .cse1) 0))) (forall ((v_ArrVal_301 Int)) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse35 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse33 (+ v_ArrVal_301 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse34 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| .cse33))) (let ((.cse28 (+ (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse35 .cse1)))) (let ((.cse30 (store .cse34 .cse1 .cse28))) (let ((.cse31 (mod .cse33 (+ (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse28 (+ 1 (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 0) (not (= .cse31 0)) (not (<= .cse32 v_ArrVal_301))))))))))) (let ((.cse37 (store .cse0 .cse26 (mod .cse27 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (or (= (select .cse37 .cse1) 0) (not (= (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (and .cse38 (not .cse39)))) (or (not (= 0 .cse23)) (= .cse20 0)) (let ((.cse41 (store .cse21 .cse26 .cse42))) (let ((.cse40 (mod (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse41) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse40 0)) (= (mod (select .cse41 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| .cse40)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))) (let ((.cse43 (store .cse13 .cse26 (+ .cse27 .cse14)))) (let ((.cse44 (mod (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod (select .cse43 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~a~0#1.offset| .cse44)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse44 0))))) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse49 (store .cse21 .cse26 1))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse49))) (let ((.cse50 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse47 (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse54 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse52 (+ v_ArrVal_301 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse53 (store .cse54 |c_ULTIMATE.start_main_~a~0#1.offset| .cse52))) (let ((.cse46 (+ (select (select (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| .cse53) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse54 .cse1)))) (let ((.cse48 (store .cse53 .cse1 .cse46))) (let ((.cse45 (mod .cse52 (+ (select (select (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| .cse48) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse45 0)) (= (mod .cse46 (+ (select (select (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| .cse45)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (<= (+ (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_298)) (not (<= (+ v_ArrVal_298 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) v_ArrVal_301)))))))))))))) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse61 (select .cse56 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse59 (+ v_ArrVal_301 (select .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse60 (store .cse61 |c_ULTIMATE.start_main_~a~0#1.offset| .cse59))) (let ((.cse55 (+ (select (select (store .cse56 |c_ULTIMATE.start_main_~a~0#1.base| .cse60) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse61 .cse1)))) (let ((.cse57 (store .cse60 .cse1 .cse55))) (let ((.cse58 (mod .cse59 (+ (select (select (store .cse56 |c_ULTIMATE.start_main_~a~0#1.base| .cse57) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse55 (+ 1 (select (select (store .cse56 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~a~0#1.offset| .cse58)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 0) (not (<= .cse32 v_ArrVal_298)) (not (= .cse58 0)) (not (<= (+ v_ArrVal_298 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26)) v_ArrVal_301))))))))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (forall ((v_ArrVal_301 Int)) (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse68 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse66 (+ v_ArrVal_301 (select .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse67 (store .cse68 |c_ULTIMATE.start_main_~a~0#1.offset| .cse66))) (let ((.cse62 (+ (select (select (store .cse63 |c_ULTIMATE.start_main_~a~0#1.base| .cse67) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse68 .cse1)))) (let ((.cse64 (store .cse67 .cse1 .cse62))) (let ((.cse65 (mod .cse66 (+ (select (select (store .cse63 |c_ULTIMATE.start_main_~a~0#1.base| .cse64) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse62 (+ 1 (select (select (store .cse63 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~a~0#1.offset| .cse65)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 0) (not (<= .cse42 v_ArrVal_301)) (not (= .cse65 0))))))))))) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse70 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse75 (select .cse70 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse73 (+ v_ArrVal_301 (select .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_main_~a~0#1.offset| .cse73))) (let ((.cse69 (+ (select (select (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| .cse74) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse75 .cse1)))) (let ((.cse71 (store .cse74 .cse1 .cse69))) (let ((.cse72 (mod .cse73 (+ (select (select (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| .cse71) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse69 (+ 1 (select (select (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse71 |c_ULTIMATE.start_main_~a~0#1.offset| .cse72)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 0) (not (= .cse72 0)) (not (<= .cse18 v_ArrVal_298)) (not (<= (+ v_ArrVal_298 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) v_ArrVal_301))))))))))) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse77 (store .cse3 .cse26 1))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse77))) (let ((.cse76 (select .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse80 (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse85 (select .cse80 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse83 (+ v_ArrVal_301 (select .cse85 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse84 (store .cse85 |c_ULTIMATE.start_main_~a~0#1.offset| .cse83))) (let ((.cse79 (+ (select .cse85 .cse1) (select (select (store .cse80 |c_ULTIMATE.start_main_~a~0#1.base| .cse84) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse81 (store .cse84 .cse1 .cse79))) (let ((.cse82 (mod .cse83 (+ (select (select (store .cse80 |c_ULTIMATE.start_main_~a~0#1.base| .cse81) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (<= (+ (select .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse77 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_298)) (not (<= (+ (select (select (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse76 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_298) v_ArrVal_301)) (= (mod .cse79 (+ (select (select (store .cse80 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse81 |c_ULTIMATE.start_main_~a~0#1.offset| .cse82)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse82 0)))))))))))))) (let ((.cse86 (let ((.cse87 (store .cse21 .cse88 (+ .cse89 .cse90 1)))) (store .cse87 .cse26 (mod .cse27 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse87) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))) (or .cse39 (= (select .cse86 .cse1) 0) (not .cse38) (not (= (select .cse86 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))))))) is different from true [2022-12-13 17:53:55,265 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse49 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse47 (+ .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse15 (select .cse17 .cse47)) (.cse19 (+ .cse1 1))) (let ((.cse18 (+ .cse49 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse48 (mod .cse15 .cse19))) (let ((.cse2 (store .cse17 .cse47 .cse48)) (.cse0 (select .cse17 .cse3)) (.cse5 (store .cse17 .cse47 1)) (.cse22 (= .cse48 0)) (.cse21 (< .cse15 0)) (.cse14 (select .cse17 .cse18))) (and (<= (+ .cse0 1) (* .cse1 2)) (or (= (select .cse2 .cse3) 0) (not (= (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse13 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse11 (+ v_ArrVal_301 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| .cse11))) (let ((.cse7 (+ (select .cse13 .cse3) (select (select (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse9 (store .cse12 .cse3 .cse7))) (let ((.cse10 (mod .cse11 (+ (select (select (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (<= (+ (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_298)) (not (<= (+ v_ArrVal_298 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) v_ArrVal_301)) (= (mod .cse7 (+ (select (select (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| .cse10)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse10 0))))))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (= .cse14 0) (not (= .cse15 0))) (let ((.cse16 (store .cse17 .cse18 (mod .cse14 .cse19)))) (or (not (= (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse16 .cse3) 0))) (let ((.cse20 (store .cse2 .cse18 (mod .cse14 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (or (= (select .cse20 .cse3) 0) (not (= (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (and .cse21 (not .cse22)))) (let ((.cse24 (store .cse17 .cse18 (+ .cse1 .cse14)))) (let ((.cse23 (mod (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse23 0)) (= (mod (select .cse24 .cse3) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| .cse23)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))) (= .cse0 .cse19) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse29 (store .cse17 .cse18 1))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29))) (let ((.cse30 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse34 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse32 (+ v_ArrVal_301 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse33 (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| .cse32))) (let ((.cse26 (+ (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse34 .cse3)))) (let ((.cse28 (store .cse33 .cse3 .cse26))) (let ((.cse25 (mod .cse32 (+ (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse25 0)) (= (mod .cse26 (+ (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| .cse25)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (<= (+ (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_298)) (not (<= (+ v_ArrVal_298 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) v_ArrVal_301)))))))))))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= .cse19 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse36 (store .cse5 .cse18 1))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36))) (let ((.cse35 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse44 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse42 (+ v_ArrVal_301 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse43 (store .cse44 |c_ULTIMATE.start_main_~a~0#1.offset| .cse42))) (let ((.cse38 (+ (select .cse44 .cse3) (select (select (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse40 (store .cse43 .cse3 .cse38))) (let ((.cse41 (mod .cse42 (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (<= (+ (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_298)) (not (<= (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) v_ArrVal_298) v_ArrVal_301)) (= (mod .cse38 (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| .cse41)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse41 0)))))))))))))) (let ((.cse45 (let ((.cse46 (store .cse17 .cse47 (+ .cse1 .cse48 1)))) (store .cse46 .cse18 (mod .cse14 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))) (or .cse22 (= (select .cse45 .cse3) 0) (not .cse21) (not (= (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))))))) is different from true [2022-12-13 17:53:57,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:53:59,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:01,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:03,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:05,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:07,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:09,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:11,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:13,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:15,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:17,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:19,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:21,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:23,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:25,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:28,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:30,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:32,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:34,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:36,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:38,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:40,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:43,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:47,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:54:49,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:55:26,352 WARN L233 SmtUtils]: Spent 15.24s on a formula simplification that was a NOOP. DAG size: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:55:31,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:55:33,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:55:35,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:56:11,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:56:13,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:56:16,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:56:19,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:56:21,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:56:23,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-12-13 17:56:38,385 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 160 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:56:45,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-12-13 17:56:46,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2022-12-13 17:56:48,571 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse56 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse53 (+ .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse22 (+ .cse28 1)) (.cse55 (select .cse17 .cse53))) (let ((.cse20 (+ .cse56 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (store .cse17 .cse53 (+ .cse28 .cse55))) (.cse54 (mod .cse55 .cse22))) (let ((.cse0 (store .cse17 .cse53 .cse54)) (.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (store .cse17 .cse53 1)) (.cse25 (= .cse54 0)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse24 (< .cse55 0)) (.cse21 (select .cse17 .cse20))) (and (or (= (select .cse0 .cse1) 0) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse11 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse9 (+ v_ArrVal_301 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| .cse9))) (let ((.cse5 (+ (select .cse11 .cse1) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse7 (store .cse10 .cse1 .cse5))) (let ((.cse8 (mod .cse9 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (<= (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_298)) (not (<= (+ v_ArrVal_298 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) v_ArrVal_301)) (= (mod .cse5 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse8 0))))))))))))) (let ((.cse12 (mod (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse14 1)))) (or (not (= .cse12 0)) (= (mod (select .cse13 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| .cse12)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse15 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (let ((.cse18 (+ .cse15 1))) (mod .cse18 .cse18)))) (and (<= 2 .cse15) (= .cse16 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse17 .cse1) .cse16))))) (let ((.cse19 (store .cse17 .cse20 (mod .cse21 .cse22)))) (or (not (= (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse19 .cse1) 0))) (let ((.cse23 (store .cse0 .cse20 (mod .cse21 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (or (= (select .cse23 .cse1) 0) (not (= (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (and .cse24 (not .cse25)))) (let ((.cse27 (store .cse17 .cse20 (+ .cse28 .cse21)))) (let ((.cse26 (mod (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse26 0)) (= (mod (select .cse27 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| .cse26)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))) (let ((.cse29 (store .cse13 .cse20 (+ .cse21 .cse14)))) (let ((.cse30 (mod (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod (select .cse29 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| .cse30)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse30 0))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse35 (store .cse17 .cse20 1))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35))) (let ((.cse36 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse40 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse38 (+ v_ArrVal_301 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse39 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| .cse38))) (let ((.cse32 (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse40 .cse1)))) (let ((.cse34 (store .cse39 .cse1 .cse32))) (let ((.cse31 (mod .cse38 (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse31 0)) (= (mod .cse32 (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (<= (+ (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_298)) (not (<= (+ v_ArrVal_298 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) v_ArrVal_301)))))))))))))) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse42 (store .cse3 .cse20 1))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse42))) (let ((.cse41 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse50 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse48 (+ v_ArrVal_301 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse49 (store .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| .cse48))) (let ((.cse44 (+ (select .cse50 .cse1) (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse46 (store .cse49 .cse1 .cse44))) (let ((.cse47 (mod .cse48 (+ (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (<= (+ (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_298)) (not (<= (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_298) v_ArrVal_301)) (= (mod .cse44 (+ (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| .cse47)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse47 0)))))))))))))) (let ((.cse51 (let ((.cse52 (store .cse17 .cse53 (+ .cse28 .cse54 1)))) (store .cse52 .cse20 (mod .cse21 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse52) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))) (or .cse25 (= (select .cse51 .cse1) 0) (not .cse24) (not (= (select .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))))))) is different from false [2022-12-13 17:56:50,581 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse56 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse53 (+ .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse22 (+ .cse28 1)) (.cse55 (select .cse17 .cse53))) (let ((.cse20 (+ .cse56 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (store .cse17 .cse53 (+ .cse28 .cse55))) (.cse54 (mod .cse55 .cse22))) (let ((.cse0 (store .cse17 .cse53 .cse54)) (.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (store .cse17 .cse53 1)) (.cse25 (= .cse54 0)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse24 (< .cse55 0)) (.cse21 (select .cse17 .cse20))) (and (or (= (select .cse0 .cse1) 0) (not (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse11 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse9 (+ v_ArrVal_301 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| .cse9))) (let ((.cse5 (+ (select .cse11 .cse1) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse7 (store .cse10 .cse1 .cse5))) (let ((.cse8 (mod .cse9 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (<= (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_298)) (not (<= (+ v_ArrVal_298 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) v_ArrVal_301)) (= (mod .cse5 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse8 0))))))))))))) (let ((.cse12 (mod (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse14 1)))) (or (not (= .cse12 0)) (= (mod (select .cse13 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| .cse12)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse15 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (let ((.cse18 (+ .cse15 1))) (mod .cse18 .cse18)))) (and (<= 2 .cse15) (= .cse16 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse17 .cse1) .cse16))))) (let ((.cse19 (store .cse17 .cse20 (mod .cse21 .cse22)))) (or (not (= (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse19 .cse1) 0))) (let ((.cse23 (store .cse0 .cse20 (mod .cse21 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (or (= (select .cse23 .cse1) 0) (not (= (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (and .cse24 (not .cse25)))) (let ((.cse27 (store .cse17 .cse20 (+ .cse28 .cse21)))) (let ((.cse26 (mod (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse26 0)) (= (mod (select .cse27 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| .cse26)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))) (let ((.cse29 (store .cse13 .cse20 (+ .cse21 .cse14)))) (let ((.cse30 (mod (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod (select .cse29 .cse1) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| .cse30)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse30 0))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse35 (store .cse17 .cse20 1))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35))) (let ((.cse36 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse40 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse38 (+ v_ArrVal_301 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse39 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| .cse38))) (let ((.cse32 (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse40 .cse1)))) (let ((.cse34 (store .cse39 .cse1 .cse32))) (let ((.cse31 (mod .cse38 (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse31 0)) (= (mod .cse32 (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (<= (+ (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_298)) (not (<= (+ v_ArrVal_298 (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) v_ArrVal_301)))))))))))))) (forall ((v_ArrVal_301 Int) (v_ArrVal_298 Int)) (let ((.cse42 (store .cse3 .cse20 1))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse42))) (let ((.cse41 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_301)))) (let ((.cse50 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse48 (+ v_ArrVal_301 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse49 (store .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| .cse48))) (let ((.cse44 (+ (select .cse50 .cse1) (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse46 (store .cse49 .cse1 .cse44))) (let ((.cse47 (mod .cse48 (+ (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (<= (+ (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_298)) (not (<= (+ (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_298)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_298) v_ArrVal_301)) (= (mod .cse44 (+ (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| .cse47)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse47 0)))))))))))))) (let ((.cse51 (let ((.cse52 (store .cse17 .cse53 (+ .cse28 .cse54 1)))) (store .cse52 .cse20 (mod .cse21 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse52) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))) (or .cse25 (= (select .cse51 .cse1) 0) (not .cse24) (not (= (select .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))))))) is different from true