/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/array-crafted/mapavg5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 14:49:54,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 14:49:54,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 14:49:54,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 14:49:54,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 14:49:54,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 14:49:54,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 14:49:54,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 14:49:54,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 14:49:54,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 14:49:54,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 14:49:54,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 14:49:54,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 14:49:54,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 14:49:54,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 14:49:54,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 14:49:54,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 14:49:54,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 14:49:54,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 14:49:54,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 14:49:54,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 14:49:54,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 14:49:54,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 14:49:54,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 14:49:54,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 14:49:54,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 14:49:54,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 14:49:54,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 14:49:54,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 14:49:54,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 14:49:54,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 14:49:54,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 14:49:54,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 14:49:54,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 14:49:54,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 14:49:54,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 14:49:54,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 14:49:54,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 14:49:54,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 14:49:54,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 14:49:54,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 14:49:54,360 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-02 14:49:54,389 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 14:49:54,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 14:49:54,390 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 14:49:54,390 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 14:49:54,391 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 14:49:54,391 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 14:49:54,391 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-02 14:49:54,392 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-02 14:49:54,392 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-02 14:49:54,392 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-02 14:49:54,393 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-02 14:49:54,393 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-02 14:49:54,393 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-02 14:49:54,393 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-02 14:49:54,393 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-02 14:49:54,393 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-02 14:49:54,393 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-02 14:49:54,393 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-02 14:49:54,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 14:49:54,394 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 14:49:54,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 14:49:54,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 14:49:54,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 14:49:54,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 14:49:54,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 14:49:54,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 14:49:54,395 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 14:49:54,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 14:49:54,395 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 14:49:54,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 14:49:54,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 14:49:54,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 14:49:54,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 14:49:54,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 14:49:54,396 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-02 14:49:54,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 14:49:54,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 14:49:54,396 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-02 14:49:54,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 14:49:54,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 14:49:54,397 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-02 14:49:54,397 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.sifa: Abstract Domain -> OctagonDomain [2023-04-02 14:49:54,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 14:49:54,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 14:49:54,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 14:49:54,641 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 14:49:54,641 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 14:49:54,642 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/mapavg5.i [2023-04-02 14:49:55,893 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 14:49:56,074 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 14:49:56,075 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapavg5.i [2023-04-02 14:49:56,083 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd989e634/adcfc1a7c9944c1d9bf368d77a5b49e0/FLAG52404f1ba [2023-04-02 14:49:56,094 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd989e634/adcfc1a7c9944c1d9bf368d77a5b49e0 [2023-04-02 14:49:56,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 14:49:56,097 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 14:49:56,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 14:49:56,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 14:49:56,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 14:49:56,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 02:49:56" (1/1) ... [2023-04-02 14:49:56,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3181cdf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:49:56, skipping insertion in model container [2023-04-02 14:49:56,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 02:49:56" (1/1) ... [2023-04-02 14:49:56,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 14:49:56,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 14:49:56,251 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapavg5.i[1383,1396] [2023-04-02 14:49:56,255 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 14:49:56,263 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 14:49:56,281 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapavg5.i[1383,1396] [2023-04-02 14:49:56,282 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 14:49:56,294 INFO L208 MainTranslator]: Completed translation [2023-04-02 14:49:56,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:49:56 WrapperNode [2023-04-02 14:49:56,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 14:49:56,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 14:49:56,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 14:49:56,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 14:49:56,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:49:56" (1/1) ... [2023-04-02 14:49:56,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:49:56" (1/1) ... [2023-04-02 14:49:56,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:49:56" (1/1) ... [2023-04-02 14:49:56,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:49:56" (1/1) ... [2023-04-02 14:49:56,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:49:56" (1/1) ... [2023-04-02 14:49:56,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:49:56" (1/1) ... [2023-04-02 14:49:56,322 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:49:56" (1/1) ... [2023-04-02 14:49:56,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:49:56" (1/1) ... [2023-04-02 14:49:56,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 14:49:56,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 14:49:56,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 14:49:56,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 14:49:56,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:49:56" (1/1) ... [2023-04-02 14:49:56,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 14:49:56,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:49:56,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-02 14:49:56,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-02 14:49:56,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 14:49:56,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 14:49:56,405 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 14:49:56,407 INFO L138 BoogieDeclarations]: Found implementation of procedure mapavg [2023-04-02 14:49:56,407 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 14:49:56,407 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 14:49:56,407 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 14:49:56,407 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-02 14:49:56,408 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-02 14:49:56,408 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 14:49:56,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 14:49:56,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 14:49:56,408 INFO L130 BoogieDeclarations]: Found specification of procedure mapavg [2023-04-02 14:49:56,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 14:49:56,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 14:49:56,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-02 14:49:56,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 14:49:56,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 14:49:56,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 14:49:56,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 14:49:56,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 14:49:56,482 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 14:49:56,483 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 14:49:56,650 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 14:49:56,686 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 14:49:56,686 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-04-02 14:49:56,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 02:49:56 BoogieIcfgContainer [2023-04-02 14:49:56,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 14:49:56,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 14:49:56,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 14:49:56,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 14:49:56,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 02:49:56" (1/3) ... [2023-04-02 14:49:56,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7394e24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 02:49:56, skipping insertion in model container [2023-04-02 14:49:56,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:49:56" (2/3) ... [2023-04-02 14:49:56,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7394e24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 02:49:56, skipping insertion in model container [2023-04-02 14:49:56,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 02:49:56" (3/3) ... [2023-04-02 14:49:56,696 INFO L112 eAbstractionObserver]: Analyzing ICFG mapavg5.i [2023-04-02 14:49:56,713 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 14:49:56,713 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 14:49:56,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 14:49:56,758 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=FINITE_AUTOMATA, 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;@4f04ac64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-02 14:49:56,758 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 14:49:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 14:49:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-04-02 14:49:56,767 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:49:56,767 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] [2023-04-02 14:49:56,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:49:56,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:49:56,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1232830300, now seen corresponding path program 1 times [2023-04-02 14:49:56,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:49:56,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117458521] [2023-04-02 14:49:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:49:56,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:49:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:49:56,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:49:56,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117458521] [2023-04-02 14:49:56,921 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-04-02 14:49:56,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291123713] [2023-04-02 14:49:56,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:49:56,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:49:56,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:49:56,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:49:56,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-02 14:49:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:49:57,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-02 14:49:57,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:49:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-02 14:49:57,149 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 14:49:57,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291123713] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 14:49:57,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 14:49:57,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-02 14:49:57,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111713618] [2023-04-02 14:49:57,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 14:49:57,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 14:49:57,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:49:57,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 14:49:57,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 14:49:57,189 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-02 14:49:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:49:57,248 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2023-04-02 14:49:57,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 14:49:57,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-04-02 14:49:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:49:57,256 INFO L225 Difference]: With dead ends: 44 [2023-04-02 14:49:57,256 INFO L226 Difference]: Without dead ends: 21 [2023-04-02 14:49:57,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 14:49:57,263 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 14:49:57,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 14:49:57,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-04-02 14:49:57,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-04-02 14:49:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 14:49:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-04-02 14:49:57,297 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2023-04-02 14:49:57,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:49:57,297 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-04-02 14:49:57,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-02 14:49:57,298 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-04-02 14:49:57,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-02 14:49:57,299 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:49:57,299 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] [2023-04-02 14:49:57,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-02 14:49:57,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-04-02 14:49:57,507 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:49:57,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:49:57,508 INFO L85 PathProgramCache]: Analyzing trace with hash -991599681, now seen corresponding path program 1 times [2023-04-02 14:49:57,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:49:57,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694827319] [2023-04-02 14:49:57,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:49:57,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:49:57,554 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 14:49:57,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [40242832] [2023-04-02 14:49:57,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:49:57,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:49:57,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:49:57,563 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:49:57,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-02 14:49:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:49:57,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-02 14:49:57,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:49:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-02 14:49:57,744 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:49:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-02 14:49:57,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:49:57,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694827319] [2023-04-02 14:49:57,816 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 14:49:57,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40242832] [2023-04-02 14:49:57,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40242832] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:49:57,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [924125554] [2023-04-02 14:49:57,835 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-02 14:49:57,836 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:49:57,841 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:49:57,845 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:49:57,845 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:49:57,978 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 14:49:58,287 INFO L197 IcfgInterpreter]: Interpreting procedure mapavg with input of size 34 for LOIs [2023-04-02 14:49:58,328 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 14:49:58,337 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:49:58,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [924125554] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 14:49:58,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-02 14:49:58,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 4] total 15 [2023-04-02 14:49:58,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013934319] [2023-04-02 14:49:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 14:49:58,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 14:49:58,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:49:58,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 14:49:58,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-04-02 14:49:58,686 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 11 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 14:49:58,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:49:58,961 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2023-04-02 14:49:58,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 14:49:58,962 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-04-02 14:49:58,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:49:58,964 INFO L225 Difference]: With dead ends: 34 [2023-04-02 14:49:58,964 INFO L226 Difference]: Without dead ends: 22 [2023-04-02 14:49:58,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-04-02 14:49:58,967 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 14:49:58,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 24 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 14:49:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-04-02 14:49:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-04-02 14:49:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 14:49:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-04-02 14:49:58,986 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 26 [2023-04-02 14:49:58,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:49:58,986 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-04-02 14:49:58,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 14:49:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-04-02 14:49:58,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-02 14:49:58,987 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:49:58,988 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:49:58,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-02 14:49:59,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-04-02 14:49:59,194 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:49:59,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:49:59,195 INFO L85 PathProgramCache]: Analyzing trace with hash -412123937, now seen corresponding path program 1 times [2023-04-02 14:49:59,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:49:59,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797240183] [2023-04-02 14:49:59,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:49:59,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:49:59,214 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 14:49:59,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1059315479] [2023-04-02 14:49:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:49:59,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:49:59,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:49:59,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:49:59,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-02 14:49:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:49:59,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-02 14:49:59,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:49:59,336 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-02 14:49:59,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:49:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-02 14:49:59,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:49:59,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797240183] [2023-04-02 14:49:59,369 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 14:49:59,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059315479] [2023-04-02 14:49:59,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059315479] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:49:59,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1103036366] [2023-04-02 14:49:59,377 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-02 14:49:59,377 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:49:59,378 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:49:59,378 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:49:59,378 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:49:59,408 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 14:49:59,886 INFO L197 IcfgInterpreter]: Interpreting procedure mapavg with input of size 34 for LOIs [2023-04-02 14:49:59,961 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 14:49:59,966 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:50:00,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1103036366] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 14:50:00,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-04-02 14:50:00,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [4, 4] total 19 [2023-04-02 14:50:00,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690873220] [2023-04-02 14:50:00,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 14:50:00,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-02 14:50:00,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:50:00,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-02 14:50:00,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=286, Unknown=1, NotChecked=0, Total=342 [2023-04-02 14:50:00,865 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 14:50:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:50:01,256 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2023-04-02 14:50:01,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 14:50:01,256 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2023-04-02 14:50:01,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:50:01,257 INFO L225 Difference]: With dead ends: 32 [2023-04-02 14:50:01,257 INFO L226 Difference]: Without dead ends: 23 [2023-04-02 14:50:01,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=80, Invalid=425, Unknown=1, NotChecked=0, Total=506 [2023-04-02 14:50:01,258 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 14:50:01,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 20 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 4 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 14:50:01,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-04-02 14:50:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-04-02 14:50:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 14:50:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-04-02 14:50:01,266 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2023-04-02 14:50:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:50:01,267 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-04-02 14:50:01,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 14:50:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-04-02 14:50:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-04-02 14:50:01,268 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:50:01,268 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:50:01,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-02 14:50:01,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:50:01,475 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:50:01,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:50:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash 227748705, now seen corresponding path program 1 times [2023-04-02 14:50:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:50:01,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677603600] [2023-04-02 14:50:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:50:01,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:50:01,498 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 14:50:01,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1322332903] [2023-04-02 14:50:01,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:50:01,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:50:01,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:50:01,505 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:50:01,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-02 14:50:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 14:50:01,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-02 14:50:01,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:50:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-02 14:50:01,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:50:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-02 14:50:01,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:50:01,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677603600] [2023-04-02 14:50:01,622 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 14:50:01,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322332903] [2023-04-02 14:50:01,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322332903] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:50:01,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1009486051] [2023-04-02 14:50:01,625 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-02 14:50:01,625 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:50:01,625 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:50:01,625 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:50:01,625 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:50:01,644 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 14:50:02,589 INFO L197 IcfgInterpreter]: Interpreting procedure mapavg with input of size 34 for LOIs [2023-04-02 14:50:02,651 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 14:50:02,655 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:50:04,375 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '927#(and (<= 1 |#StackHeapBarrier|) (<= 0 (+ main_~ret2~0 2147483648)) (<= ~N~0 2147483647) (<= main_~ret~1 2147483647) (<= main_~ret5~0 2147483647) (or (not (= main_~ret~1 main_~ret5~0)) (not (= main_~ret~1 main_~ret2~0))) (<= ~N~0 (+ main_~i~2 1)) (<= ~N~0 main_~i~1) (<= 0 (+ main_~ret5~0 2147483648)) (<= 0 (+ main_~ret~1 2147483648)) (<= main_~ret2~0 2147483647) (= |main_~#x~0.offset| 0) (<= 2 ~N~0) (= |old(~N~0)| 0) (= |#NULL.offset| 0) (<= (+ |#StackHeapBarrier| 1) |main_~#x~0.base|) (= |#NULL.base| 0))' at error location [2023-04-02 14:50:04,376 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 14:50:04,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 14:50:04,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-04-02 14:50:04,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757246438] [2023-04-02 14:50:04,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 14:50:04,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 14:50:04,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:50:04,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 14:50:04,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=415, Unknown=8, NotChecked=0, Total=506 [2023-04-02 14:50:04,378 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-02 14:50:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:50:04,395 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2023-04-02 14:50:04,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 14:50:04,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 30 [2023-04-02 14:50:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:50:04,396 INFO L225 Difference]: With dead ends: 39 [2023-04-02 14:50:04,396 INFO L226 Difference]: Without dead ends: 24 [2023-04-02 14:50:04,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=83, Invalid=415, Unknown=8, NotChecked=0, Total=506 [2023-04-02 14:50:04,397 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 14:50:04,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 14:50:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-04-02 14:50:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-04-02 14:50:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 14:50:04,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-04-02 14:50:04,404 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 30 [2023-04-02 14:50:04,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:50:04,404 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-04-02 14:50:04,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-02 14:50:04,404 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-04-02 14:50:04,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-02 14:50:04,405 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:50:04,405 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:50:04,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-04-02 14:50:04,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:50:04,611 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:50:04,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:50:04,612 INFO L85 PathProgramCache]: Analyzing trace with hash 94866654, now seen corresponding path program 2 times [2023-04-02 14:50:04,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:50:04,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031142213] [2023-04-02 14:50:04,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:50:04,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:50:04,639 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 14:50:04,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [309054508] [2023-04-02 14:50:04,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 14:50:04,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:50:04,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:50:04,651 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:50:04,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-02 14:50:04,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-02 14:50:04,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 14:50:04,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-02 14:50:04,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:50:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 14:50:04,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:50:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-02 14:50:04,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 14:50:04,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031142213] [2023-04-02 14:50:04,826 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 14:50:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309054508] [2023-04-02 14:50:04,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309054508] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 14:50:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1465499581] [2023-04-02 14:50:04,829 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-02 14:50:04,829 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 14:50:04,829 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 14:50:04,830 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 14:50:04,830 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 14:50:04,847 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 22 for LOIs [2023-04-02 14:50:05,635 INFO L197 IcfgInterpreter]: Interpreting procedure mapavg with input of size 34 for LOIs [2023-04-02 14:50:05,691 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-02 14:50:05,694 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 14:50:07,202 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1236#(and (<= 1 |#StackHeapBarrier|) (<= 0 (+ main_~ret2~0 2147483648)) (<= ~N~0 2147483647) (<= main_~ret~1 2147483647) (<= main_~ret5~0 2147483647) (or (not (= main_~ret~1 main_~ret5~0)) (not (= main_~ret~1 main_~ret2~0))) (<= ~N~0 (+ main_~i~2 1)) (<= ~N~0 main_~i~1) (<= 0 (+ main_~ret5~0 2147483648)) (<= 0 (+ main_~ret~1 2147483648)) (<= main_~ret2~0 2147483647) (= |main_~#x~0.offset| 0) (<= 2 ~N~0) (= |old(~N~0)| 0) (= |#NULL.offset| 0) (<= (+ |#StackHeapBarrier| 1) |main_~#x~0.base|) (= |#NULL.base| 0))' at error location [2023-04-02 14:50:07,203 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 14:50:07,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 14:50:07,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2023-04-02 14:50:07,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007130522] [2023-04-02 14:50:07,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 14:50:07,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 14:50:07,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 14:50:07,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 14:50:07,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=480, Unknown=8, NotChecked=0, Total=600 [2023-04-02 14:50:07,204 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-02 14:50:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 14:50:07,267 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2023-04-02 14:50:07,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 14:50:07,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 31 [2023-04-02 14:50:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 14:50:07,268 INFO L225 Difference]: With dead ends: 39 [2023-04-02 14:50:07,268 INFO L226 Difference]: Without dead ends: 25 [2023-04-02 14:50:07,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=112, Invalid=480, Unknown=8, NotChecked=0, Total=600 [2023-04-02 14:50:07,270 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 14:50:07,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 37 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 14:50:07,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-04-02 14:50:07,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-04-02 14:50:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 14:50:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-04-02 14:50:07,277 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 31 [2023-04-02 14:50:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 14:50:07,277 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-04-02 14:50:07,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-02 14:50:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-04-02 14:50:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-04-02 14:50:07,281 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 14:50:07,281 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 14:50:07,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-02 14:50:07,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:50:07,485 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 14:50:07,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 14:50:07,486 INFO L85 PathProgramCache]: Analyzing trace with hash 301472844, now seen corresponding path program 3 times [2023-04-02 14:50:07,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 14:50:07,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683924984] [2023-04-02 14:50:07,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 14:50:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 14:50:07,502 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 14:50:07,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [116421247] [2023-04-02 14:50:07,502 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 14:50:07,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 14:50:07,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 14:50:07,507 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 14:50:07,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-02 14:50:07,738 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 14:50:07,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 14:50:07,741 WARN L260 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 116 conjunts are in the unsatisfiable core [2023-04-02 14:50:07,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 14:50:07,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 14:50:07,805 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 21 treesize of output 20 [2023-04-02 14:50:08,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 14:50:08,483 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 1 case distinctions, treesize of input 268 treesize of output 156 [2023-04-02 14:50:12,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 14:50:12,612 INFO L321 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2023-04-02 14:50:12,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 461 treesize of output 290 [2023-04-02 14:50:14,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 14:50:14,094 INFO L321 Elim1Store]: treesize reduction 75, result has 39.5 percent of original size [2023-04-02 14:50:14,095 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 9 case distinctions, treesize of input 400 treesize of output 333 [2023-04-02 14:50:17,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 14:50:17,789 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 14:50:18,110 INFO L321 Elim1Store]: treesize reduction 8, result has 71.4 percent of original size [2023-04-02 14:50:18,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 774 treesize of output 409 [2023-04-02 14:50:41,349 WARN L223 SmtUtils]: Spent 21.57s on a formula simplification. DAG size of input: 85 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 14:51:03,395 WARN L223 SmtUtils]: Spent 20.97s on a formula simplification. DAG size of input: 77 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 14:51:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-02 14:51:03,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 14:51:23,884 WARN L223 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 96 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 14:51:50,590 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_main_~#x~0.base|))) (let ((.cse0 (<= 0 c_~N~0)) (.cse34 (< c_~N~0 0)) (.cse9 (= |c_main_#t~ret9| c_main_~ret~1)) (.cse13 (+ c_main_~ret~1 4294967296)) (.cse4 (+ |c_main_~#x~0.offset| 4)) (.cse7 (+ |c_main_~#x~0.offset| (* c_~N~0 4) (- 4))) (.cse8 (select .cse5 |c_main_~#x~0.offset|))) (and (or .cse0 (and (or (forall ((v_main_~i~2_24 Int)) (let ((.cse2 (let ((.cse3 (store (let ((.cse6 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse6 |c_main_~#x~0.offset|) (select .cse5 (+ .cse6 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse3 |c_main_~#x~0.offset|) (select .cse3 .cse4) 1)))) (let ((.cse1 (div .cse2 c_~N~0))) (or (<= (mod (+ .cse1 1) 4294967296) 2147483647) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse2) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse2 c_~N~0) 0) (<= (mod (+ 4294967295 .cse1) 4294967296) 2147483647))))) .cse9) (forall ((v_main_~i~2_24 Int)) (let ((.cse11 (let ((.cse14 (store (let ((.cse15 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse15 |c_main_~#x~0.offset|) (select .cse5 (+ .cse15 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse14 |c_main_~#x~0.offset|) (select .cse14 .cse4) 1)))) (let ((.cse10 (div .cse11 c_~N~0))) (let ((.cse12 (mod (+ 4294967295 .cse10) 4294967296))) (or (<= (mod (+ .cse10 1) 4294967296) 2147483647) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse11) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse11 c_~N~0) 0) (= .cse12 .cse13) (<= .cse12 2147483647)))))))) (or (forall ((v_main_~i~2_24 Int)) (let ((.cse17 (let ((.cse18 (store (let ((.cse19 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse19 |c_main_~#x~0.offset|) (select .cse5 (+ .cse19 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse18 |c_main_~#x~0.offset|) (select .cse18 .cse4) 1)))) (let ((.cse16 (div .cse17 c_~N~0))) (or (< 0 v_main_~i~2_24) (< 2147483647 (mod (+ .cse16 1) 4294967296)) (< (+ v_main_~i~2_24 2) c_~N~0) (< .cse17 0) (<= c_~N~0 (+ v_main_~i~2_24 1)) (<= (mod .cse16 4294967296) 2147483647))))) .cse9) (forall ((v_main_~i~2_24 Int)) (let ((.cse22 (let ((.cse23 (store (let ((.cse24 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse24 |c_main_~#x~0.offset|) (select .cse5 (+ .cse24 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse23 |c_main_~#x~0.offset|) (select .cse23 .cse4) 1)))) (let ((.cse20 (div .cse22 c_~N~0))) (let ((.cse21 (mod .cse20 4294967296))) (or (<= (mod (+ .cse20 1) 4294967296) 2147483647) (< 0 v_main_~i~2_24) (= .cse13 .cse21) (< (+ v_main_~i~2_24 2) c_~N~0) (< .cse22 0) (<= c_~N~0 (+ v_main_~i~2_24 1)) (<= .cse21 2147483647)))))) (or (and (forall ((v_main_~i~2_24 Int)) (let ((.cse26 (let ((.cse28 (store (let ((.cse29 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse29 |c_main_~#x~0.offset|) (select .cse5 (+ .cse29 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse28 |c_main_~#x~0.offset|) (select .cse28 .cse4) 1)))) (let ((.cse27 (div .cse26 c_~N~0))) (let ((.cse25 (mod (+ .cse27 1) 4294967296))) (or (<= .cse25 2147483647) (< 0 v_main_~i~2_24) (= .cse25 .cse13) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse26) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse26 c_~N~0) 0) (<= (mod (+ 4294967295 .cse27) 4294967296) 2147483647)))))) (or (forall ((v_main_~i~2_24 Int)) (let ((.cse31 (let ((.cse32 (store (let ((.cse33 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse33 |c_main_~#x~0.offset|) (select .cse5 (+ .cse33 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse32 |c_main_~#x~0.offset|) (select .cse32 .cse4) 1)))) (let ((.cse30 (div .cse31 c_~N~0))) (or (<= (mod (+ .cse30 1) 4294967296) 2147483647) (< 0 v_main_~i~2_24) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse31) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse31 c_~N~0) 0) (<= (mod (+ 4294967295 .cse30) 4294967296) 2147483647))))) .cse9)) .cse34) (forall ((v_main_~i~2_24 Int)) (let ((.cse37 (let ((.cse38 (store (let ((.cse39 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse39 |c_main_~#x~0.offset|) (select .cse5 (+ .cse39 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse38 |c_main_~#x~0.offset|) (select .cse38 .cse4) 1)))) (let ((.cse35 (div .cse37 c_~N~0))) (let ((.cse36 (mod .cse35 4294967296))) (or (< 0 v_main_~i~2_24) (< 2147483647 (mod (+ .cse35 1) 4294967296)) (= .cse13 .cse36) (< (+ v_main_~i~2_24 2) c_~N~0) (<= c_~N~0 (+ v_main_~i~2_24 1)) (<= .cse36 2147483647) (not (= (mod .cse37 c_~N~0) 0))))))) (or (forall ((v_main_~i~2_24 Int)) (let ((.cse41 (let ((.cse42 (store (let ((.cse43 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse43 |c_main_~#x~0.offset|) (select .cse5 (+ .cse43 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse42 |c_main_~#x~0.offset|) (select .cse42 .cse4) 1)))) (let ((.cse40 (div .cse41 c_~N~0))) (or (<= (mod (+ .cse40 1) 4294967296) 2147483647) (< 0 v_main_~i~2_24) (< (+ v_main_~i~2_24 2) c_~N~0) (< .cse41 0) (<= c_~N~0 (+ v_main_~i~2_24 1)) (<= (mod .cse40 4294967296) 2147483647))))) .cse9) (or .cse0 (and (or (forall ((v_main_~i~2_24 Int)) (let ((.cse45 (let ((.cse46 (store (let ((.cse47 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse47 |c_main_~#x~0.offset|) (select .cse5 (+ .cse47 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse46 |c_main_~#x~0.offset|) (select .cse46 .cse4) 1)))) (let ((.cse44 (div .cse45 c_~N~0))) (or (< 2147483647 (mod (+ .cse44 1) 4294967296)) (< 2147483647 (mod (+ 4294967295 .cse44) 4294967296)) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse45) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse45 c_~N~0) 0))))) .cse9) (forall ((v_main_~i~2_24 Int)) (let ((.cse50 (let ((.cse51 (store (let ((.cse52 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse52 |c_main_~#x~0.offset|) (select .cse5 (+ .cse52 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse51 |c_main_~#x~0.offset|) (select .cse51 .cse4) 1)))) (let ((.cse49 (div .cse50 c_~N~0))) (let ((.cse48 (mod (+ 4294967295 .cse49) 4294967296))) (or (= .cse48 c_main_~ret~1) (< 2147483647 (mod (+ .cse49 1) 4294967296)) (< 2147483647 .cse48) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse50) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse50 c_~N~0) 0)))))))) (or (and (or (forall ((v_main_~i~2_24 Int)) (let ((.cse54 (let ((.cse55 (store (let ((.cse56 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse56 |c_main_~#x~0.offset|) (select .cse5 (+ .cse56 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse55 |c_main_~#x~0.offset|) (select .cse55 .cse4) 1)))) (let ((.cse53 (div .cse54 c_~N~0))) (or (<= (mod (+ .cse53 1) 4294967296) 2147483647) (< 2147483647 (mod (+ 4294967295 .cse53) 4294967296)) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse54) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse54 c_~N~0) 0))))) .cse9) (forall ((v_main_~i~2_24 Int)) (let ((.cse59 (let ((.cse60 (store (let ((.cse61 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse61 |c_main_~#x~0.offset|) (select .cse5 (+ .cse61 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse60 |c_main_~#x~0.offset|) (select .cse60 .cse4) 1)))) (let ((.cse57 (div .cse59 c_~N~0))) (let ((.cse58 (mod (+ 4294967295 .cse57) 4294967296))) (or (<= (mod (+ .cse57 1) 4294967296) 2147483647) (= .cse58 c_main_~ret~1) (< 2147483647 .cse58) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse59) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse59 c_~N~0) 0))))))) .cse0) (or (forall ((v_main_~i~2_24 Int)) (let ((.cse63 (let ((.cse64 (store (let ((.cse65 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse65 |c_main_~#x~0.offset|) (select .cse5 (+ .cse65 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse64 |c_main_~#x~0.offset|) (select .cse64 .cse4) 1)))) (let ((.cse62 (div .cse63 c_~N~0))) (or (<= (mod (+ .cse62 1) 4294967296) 2147483647) (< 0 v_main_~i~2_24) (< 2147483647 (mod .cse62 4294967296)) (< (+ v_main_~i~2_24 2) c_~N~0) (<= c_~N~0 (+ v_main_~i~2_24 1)) (not (= (mod .cse63 c_~N~0) 0)))))) .cse9) (forall ((v_main_~i~2_24 Int)) (let ((.cse68 (let ((.cse69 (store (let ((.cse70 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse70 |c_main_~#x~0.offset|) (select .cse5 (+ .cse70 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse69 |c_main_~#x~0.offset|) (select .cse69 .cse4) 1)))) (let ((.cse66 (div .cse68 c_~N~0))) (let ((.cse67 (mod .cse66 4294967296))) (or (<= (mod (+ .cse66 1) 4294967296) 2147483647) (< 0 v_main_~i~2_24) (< 2147483647 .cse67) (< (+ v_main_~i~2_24 2) c_~N~0) (<= c_~N~0 (+ v_main_~i~2_24 1)) (not (= (mod .cse68 c_~N~0) 0)) (= c_main_~ret~1 .cse67)))))) (or (forall ((v_main_~i~2_24 Int)) (let ((.cse72 (let ((.cse73 (store (let ((.cse74 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse74 |c_main_~#x~0.offset|) (select .cse5 (+ .cse74 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse73 |c_main_~#x~0.offset|) (select .cse73 .cse4) 1)))) (let ((.cse71 (div .cse72 c_~N~0))) (or (<= (mod (+ .cse71 1) 4294967296) 2147483647) (< 0 v_main_~i~2_24) (< (+ v_main_~i~2_24 2) c_~N~0) (<= c_~N~0 (+ v_main_~i~2_24 1)) (<= (mod .cse71 4294967296) 2147483647) (not (= (mod .cse72 c_~N~0) 0)))))) .cse9) (or (forall ((v_main_~i~2_24 Int)) (let ((.cse76 (let ((.cse77 (store (let ((.cse78 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse78 |c_main_~#x~0.offset|) (select .cse5 (+ .cse78 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse77 |c_main_~#x~0.offset|) (select .cse77 .cse4) 1)))) (let ((.cse75 (div .cse76 c_~N~0))) (or (< 0 v_main_~i~2_24) (< 2147483647 (mod (+ .cse75 1) 4294967296)) (< 2147483647 (mod .cse75 4294967296)) (< (+ v_main_~i~2_24 2) c_~N~0) (< .cse76 0) (<= c_~N~0 (+ v_main_~i~2_24 1)))))) .cse9) (or (forall ((v_main_~i~2_24 Int)) (let ((.cse80 (let ((.cse81 (store (let ((.cse82 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse82 |c_main_~#x~0.offset|) (select .cse5 (+ .cse82 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse81 |c_main_~#x~0.offset|) (select .cse81 .cse4) 1)))) (let ((.cse79 (div .cse80 c_~N~0))) (or (< 0 v_main_~i~2_24) (< 2147483647 (mod (+ .cse79 1) 4294967296)) (< (+ v_main_~i~2_24 2) c_~N~0) (<= c_~N~0 (+ v_main_~i~2_24 1)) (<= (mod .cse79 4294967296) 2147483647) (not (= (mod .cse80 c_~N~0) 0)))))) .cse9) (or (and (or (forall ((v_main_~i~2_24 Int)) (let ((.cse84 (let ((.cse85 (store (let ((.cse86 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse86 |c_main_~#x~0.offset|) (select .cse5 (+ .cse86 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse85 |c_main_~#x~0.offset|) (select .cse85 .cse4) 1)))) (let ((.cse83 (div .cse84 c_~N~0))) (or (< 0 v_main_~i~2_24) (< 2147483647 (mod (+ .cse83 1) 4294967296)) (< 2147483647 (mod (+ 4294967295 .cse83) 4294967296)) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse84) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse84 c_~N~0) 0))))) .cse9) (forall ((v_main_~i~2_24 Int)) (let ((.cse89 (let ((.cse90 (store (let ((.cse91 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse91 |c_main_~#x~0.offset|) (select .cse5 (+ .cse91 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse90 |c_main_~#x~0.offset|) (select .cse90 .cse4) 1)))) (let ((.cse88 (div .cse89 c_~N~0))) (let ((.cse87 (mod (+ .cse88 1) 4294967296))) (or (< 0 v_main_~i~2_24) (< 2147483647 .cse87) (< 2147483647 (mod (+ 4294967295 .cse88) 4294967296)) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse89) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse89 c_~N~0) 0) (= .cse87 c_main_~ret~1))))))) .cse34) (forall ((v_main_~i~2_24 Int)) (let ((.cse94 (let ((.cse95 (store (let ((.cse96 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse96 |c_main_~#x~0.offset|) (select .cse5 (+ .cse96 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse95 |c_main_~#x~0.offset|) (select .cse95 .cse4) 1)))) (let ((.cse92 (div .cse94 c_~N~0))) (let ((.cse93 (mod .cse92 4294967296))) (or (<= (mod (+ .cse92 1) 4294967296) 2147483647) (< 0 v_main_~i~2_24) (< 2147483647 .cse93) (< (+ v_main_~i~2_24 2) c_~N~0) (< .cse94 0) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= c_main_~ret~1 .cse93)))))) (or (forall ((v_main_~i~2_24 Int)) (let ((.cse98 (let ((.cse99 (store (let ((.cse100 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse100 |c_main_~#x~0.offset|) (select .cse5 (+ .cse100 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse99 |c_main_~#x~0.offset|) (select .cse99 .cse4) 1)))) (let ((.cse97 (div .cse98 c_~N~0))) (or (< 0 v_main_~i~2_24) (< 2147483647 (mod (+ .cse97 1) 4294967296)) (< 2147483647 (mod .cse97 4294967296)) (< (+ v_main_~i~2_24 2) c_~N~0) (<= c_~N~0 (+ v_main_~i~2_24 1)) (not (= (mod .cse98 c_~N~0) 0)))))) .cse9) (forall ((v_main_~i~2_24 Int)) (let ((.cse103 (let ((.cse104 (store (let ((.cse105 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse105 |c_main_~#x~0.offset|) (select .cse5 (+ .cse105 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse104 |c_main_~#x~0.offset|) (select .cse104 .cse4) 1)))) (let ((.cse101 (div .cse103 c_~N~0))) (let ((.cse102 (mod .cse101 4294967296))) (or (< 0 v_main_~i~2_24) (< 2147483647 (mod (+ .cse101 1) 4294967296)) (= .cse13 .cse102) (< (+ v_main_~i~2_24 2) c_~N~0) (< .cse103 0) (<= c_~N~0 (+ v_main_~i~2_24 1)) (<= .cse102 2147483647)))))) (or (and (or (forall ((v_main_~i~2_24 Int)) (let ((.cse107 (let ((.cse108 (store (let ((.cse109 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse109 |c_main_~#x~0.offset|) (select .cse5 (+ .cse109 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse108 |c_main_~#x~0.offset|) (select .cse108 .cse4) 1)))) (let ((.cse106 (div .cse107 c_~N~0))) (or (< 0 v_main_~i~2_24) (< 2147483647 (mod (+ .cse106 1) 4294967296)) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse107) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse107 c_~N~0) 0) (<= (mod (+ 4294967295 .cse106) 4294967296) 2147483647))))) .cse9) (forall ((v_main_~i~2_24 Int)) (let ((.cse111 (let ((.cse113 (store (let ((.cse114 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse114 |c_main_~#x~0.offset|) (select .cse5 (+ .cse114 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse113 |c_main_~#x~0.offset|) (select .cse113 .cse4) 1)))) (let ((.cse112 (div .cse111 c_~N~0))) (let ((.cse110 (mod (+ .cse112 1) 4294967296))) (or (< 0 v_main_~i~2_24) (< 2147483647 .cse110) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse111) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse111 c_~N~0) 0) (<= (mod (+ 4294967295 .cse112) 4294967296) 2147483647) (= .cse110 c_main_~ret~1))))))) .cse34) (or .cse0 (and (forall ((v_main_~i~2_24 Int)) (let ((.cse116 (let ((.cse118 (store (let ((.cse119 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse119 |c_main_~#x~0.offset|) (select .cse5 (+ .cse119 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse118 |c_main_~#x~0.offset|) (select .cse118 .cse4) 1)))) (let ((.cse115 (div .cse116 c_~N~0))) (let ((.cse117 (mod (+ 4294967295 .cse115) 4294967296))) (or (< 2147483647 (mod (+ .cse115 1) 4294967296)) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse116) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse116 c_~N~0) 0) (= .cse117 .cse13) (<= .cse117 2147483647)))))) (or (forall ((v_main_~i~2_24 Int)) (let ((.cse121 (let ((.cse122 (store (let ((.cse123 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse123 |c_main_~#x~0.offset|) (select .cse5 (+ .cse123 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse122 |c_main_~#x~0.offset|) (select .cse122 .cse4) 1)))) (let ((.cse120 (div .cse121 c_~N~0))) (or (< 2147483647 (mod (+ .cse120 1) 4294967296)) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse121) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse121 c_~N~0) 0) (<= (mod (+ 4294967295 .cse120) 4294967296) 2147483647))))) .cse9))) (or (and (forall ((v_main_~i~2_24 Int)) (let ((.cse126 (let ((.cse127 (store (let ((.cse128 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse128 |c_main_~#x~0.offset|) (select .cse5 (+ .cse128 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse127 |c_main_~#x~0.offset|) (select .cse127 .cse4) 1)))) (let ((.cse125 (div .cse126 c_~N~0))) (let ((.cse124 (mod (+ .cse125 1) 4294967296))) (or (<= .cse124 2147483647) (< 0 v_main_~i~2_24) (= .cse124 .cse13) (< 2147483647 (mod (+ 4294967295 .cse125) 4294967296)) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse126) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse126 c_~N~0) 0)))))) (or (forall ((v_main_~i~2_24 Int)) (let ((.cse130 (let ((.cse131 (store (let ((.cse132 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse132 |c_main_~#x~0.offset|) (select .cse5 (+ .cse132 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse131 |c_main_~#x~0.offset|) (select .cse131 .cse4) 1)))) (let ((.cse129 (div .cse130 c_~N~0))) (or (<= (mod (+ .cse129 1) 4294967296) 2147483647) (< 0 v_main_~i~2_24) (< 2147483647 (mod (+ 4294967295 .cse129) 4294967296)) (< (+ v_main_~i~2_24 2) c_~N~0) (<= 0 .cse130) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= (mod .cse130 c_~N~0) 0))))) .cse9)) .cse34) (or (forall ((v_main_~i~2_24 Int)) (let ((.cse134 (let ((.cse135 (store (let ((.cse136 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse136 |c_main_~#x~0.offset|) (select .cse5 (+ .cse136 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse135 |c_main_~#x~0.offset|) (select .cse135 .cse4) 1)))) (let ((.cse133 (div .cse134 c_~N~0))) (or (<= (mod (+ .cse133 1) 4294967296) 2147483647) (< 0 v_main_~i~2_24) (< 2147483647 (mod .cse133 4294967296)) (< (+ v_main_~i~2_24 2) c_~N~0) (< .cse134 0) (<= c_~N~0 (+ v_main_~i~2_24 1)))))) .cse9) (forall ((v_main_~i~2_24 Int)) (let ((.cse139 (let ((.cse140 (store (let ((.cse141 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse141 |c_main_~#x~0.offset|) (select .cse5 (+ .cse141 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse140 |c_main_~#x~0.offset|) (select .cse140 .cse4) 1)))) (let ((.cse137 (div .cse139 c_~N~0))) (let ((.cse138 (mod .cse137 4294967296))) (or (< 0 v_main_~i~2_24) (< 2147483647 (mod (+ .cse137 1) 4294967296)) (< 2147483647 .cse138) (< (+ v_main_~i~2_24 2) c_~N~0) (< .cse139 0) (<= c_~N~0 (+ v_main_~i~2_24 1)) (= c_main_~ret~1 .cse138)))))) (forall ((v_main_~i~2_24 Int)) (let ((.cse144 (let ((.cse145 (store (let ((.cse146 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse146 |c_main_~#x~0.offset|) (select .cse5 (+ .cse146 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse145 |c_main_~#x~0.offset|) (select .cse145 .cse4) 1)))) (let ((.cse142 (div .cse144 c_~N~0))) (let ((.cse143 (mod .cse142 4294967296))) (or (<= (mod (+ .cse142 1) 4294967296) 2147483647) (< 0 v_main_~i~2_24) (= .cse13 .cse143) (< (+ v_main_~i~2_24 2) c_~N~0) (<= c_~N~0 (+ v_main_~i~2_24 1)) (<= .cse143 2147483647) (not (= (mod .cse144 c_~N~0) 0))))))) (forall ((v_main_~i~2_24 Int)) (let ((.cse149 (let ((.cse150 (store (let ((.cse151 (* v_main_~i~2_24 4))) (store .cse5 (+ .cse151 |c_main_~#x~0.offset|) (select .cse5 (+ .cse151 |c_main_~#x~0.offset| 4)))) .cse7 .cse8))) (+ (select .cse150 |c_main_~#x~0.offset|) (select .cse150 .cse4) 1)))) (let ((.cse147 (div .cse149 c_~N~0))) (let ((.cse148 (mod .cse147 4294967296))) (or (< 0 v_main_~i~2_24) (< 2147483647 (mod (+ .cse147 1) 4294967296)) (< 2147483647 .cse148) (< (+ v_main_~i~2_24 2) c_~N~0) (<= c_~N~0 (+ v_main_~i~2_24 1)) (not (= (mod .cse149 c_~N~0) 0)) (= c_main_~ret~1 .cse148))))))))) is different from true