./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/indp5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/indp5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74cd32c72cd70d8592a00c1c607545b16193fd55a0cff14185e764bbc115500b --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 10:45:17,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:45:17,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:45:17,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:45:17,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:45:17,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:45:17,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:45:17,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:45:17,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:45:17,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:45:17,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:45:17,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:45:17,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:45:17,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:45:17,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:45:17,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:45:17,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:45:17,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:45:17,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:45:17,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:45:17,355 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:45:17,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:45:17,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:45:17,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:45:17,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:45:17,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:45:17,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:45:17,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:45:17,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:45:17,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:45:17,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:45:17,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:45:17,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:45:17,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:45:17,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:45:17,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:45:17,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:45:17,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:45:17,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:45:17,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:45:17,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:45:17,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:45:17,371 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 10:45:17,393 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:45:17,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:45:17,393 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:45:17,393 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:45:17,394 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:45:17,394 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:45:17,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:45:17,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:45:17,395 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:45:17,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:45:17,396 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:45:17,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 10:45:17,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:45:17,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:45:17,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:45:17,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:45:17,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:45:17,397 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:45:17,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:45:17,398 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:45:17,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:45:17,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:45:17,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:45:17,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:45:17,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:45:17,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:45:17,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:45:17,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:45:17,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 10:45:17,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 10:45:17,400 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:45:17,400 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:45:17,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:45:17,400 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.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 74cd32c72cd70d8592a00c1c607545b16193fd55a0cff14185e764bbc115500b [2022-07-22 10:45:17,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:45:17,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:45:17,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:45:17,591 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:45:17,596 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:45:17,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/indp5.c [2022-07-22 10:45:17,654 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae071fe35/c8068e0f7ced484dba560f0f8d840712/FLAG9c40fff68 [2022-07-22 10:45:18,051 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:45:18,052 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/indp5.c [2022-07-22 10:45:18,057 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae071fe35/c8068e0f7ced484dba560f0f8d840712/FLAG9c40fff68 [2022-07-22 10:45:18,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae071fe35/c8068e0f7ced484dba560f0f8d840712 [2022-07-22 10:45:18,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:45:18,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:45:18,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:45:18,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:45:18,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:45:18,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:45:18" (1/1) ... [2022-07-22 10:45:18,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ea7492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:45:18, skipping insertion in model container [2022-07-22 10:45:18,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:45:18" (1/1) ... [2022-07-22 10:45:18,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:45:18,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:45:18,242 WARN L230 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-fpi/indp5.c[588,601] [2022-07-22 10:45:18,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:45:18,280 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:45:18,289 WARN L230 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-fpi/indp5.c[588,601] [2022-07-22 10:45:18,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:45:18,321 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:45:18,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:45:18 WrapperNode [2022-07-22 10:45:18,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:45:18,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:45:18,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:45:18,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:45:18,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:45:18" (1/1) ... [2022-07-22 10:45:18,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:45:18" (1/1) ... [2022-07-22 10:45:18,360 INFO L137 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-07-22 10:45:18,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:45:18,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:45:18,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:45:18,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:45:18,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:45:18" (1/1) ... [2022-07-22 10:45:18,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:45:18" (1/1) ... [2022-07-22 10:45:18,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:45:18" (1/1) ... [2022-07-22 10:45:18,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:45:18" (1/1) ... [2022-07-22 10:45:18,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:45:18" (1/1) ... [2022-07-22 10:45:18,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:45:18" (1/1) ... [2022-07-22 10:45:18,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:45:18" (1/1) ... [2022-07-22 10:45:18,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:45:18,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:45:18,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:45:18,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:45:18,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:45:18" (1/1) ... [2022-07-22 10:45:18,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:45:18,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:45:18,427 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) [2022-07-22 10:45:18,429 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 [2022-07-22 10:45:18,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:45:18,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 10:45:18,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 10:45:18,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 10:45:18,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 10:45:18,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:45:18,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:45:18,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 10:45:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 10:45:18,513 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:45:18,514 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:45:18,673 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:45:18,677 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:45:18,677 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-22 10:45:18,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:45:18 BoogieIcfgContainer [2022-07-22 10:45:18,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:45:18,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:45:18,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:45:18,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:45:18,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:45:18" (1/3) ... [2022-07-22 10:45:18,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f5864e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:45:18, skipping insertion in model container [2022-07-22 10:45:18,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:45:18" (2/3) ... [2022-07-22 10:45:18,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f5864e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:45:18, skipping insertion in model container [2022-07-22 10:45:18,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:45:18" (3/3) ... [2022-07-22 10:45:18,699 INFO L111 eAbstractionObserver]: Analyzing ICFG indp5.c [2022-07-22 10:45:18,708 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:45:18,708 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:45:18,756 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:45:18,761 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@319d2d8d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@399108e1 [2022-07-22 10:45:18,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:45:18,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 10:45:18,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:45:18,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:45:18,774 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:45:18,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:45:18,778 INFO L85 PathProgramCache]: Analyzing trace with hash 118053350, now seen corresponding path program 1 times [2022-07-22 10:45:18,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:45:18,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82085224] [2022-07-22 10:45:18,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:45:18,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:45:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:45:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:45:18,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:45:18,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82085224] [2022-07-22 10:45:18,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82085224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:45:18,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:45:18,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:45:18,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925972630] [2022-07-22 10:45:18,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:45:18,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:45:18,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:45:18,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:45:18,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:45:18,950 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:45:18,962 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-07-22 10:45:18,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:45:18,965 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-22 10:45:18,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:45:18,977 INFO L225 Difference]: With dead ends: 50 [2022-07-22 10:45:18,977 INFO L226 Difference]: Without dead ends: 23 [2022-07-22 10:45:18,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:45:18,983 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:45:18,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:45:18,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-22 10:45:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-22 10:45:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-22 10:45:19,008 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 17 [2022-07-22 10:45:19,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:45:19,008 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-22 10:45:19,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-22 10:45:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 10:45:19,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:45:19,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:45:19,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 10:45:19,010 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:45:19,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:45:19,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1065017552, now seen corresponding path program 1 times [2022-07-22 10:45:19,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:45:19,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100582087] [2022-07-22 10:45:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:45:19,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:45:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:45:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:45:19,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:45:19,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100582087] [2022-07-22 10:45:19,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100582087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:45:19,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:45:19,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 10:45:19,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749786019] [2022-07-22 10:45:19,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:45:19,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 10:45:19,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:45:19,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 10:45:19,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:45:19,114 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:45:19,177 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-07-22 10:45:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 10:45:19,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-22 10:45:19,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:45:19,178 INFO L225 Difference]: With dead ends: 49 [2022-07-22 10:45:19,179 INFO L226 Difference]: Without dead ends: 33 [2022-07-22 10:45:19,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:45:19,180 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:45:19,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 13 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:45:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-22 10:45:19,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-07-22 10:45:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-22 10:45:19,190 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2022-07-22 10:45:19,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:45:19,191 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-22 10:45:19,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-22 10:45:19,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 10:45:19,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:45:19,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:45:19,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 10:45:19,193 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:45:19,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:45:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash 524088314, now seen corresponding path program 1 times [2022-07-22 10:45:19,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:45:19,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990178912] [2022-07-22 10:45:19,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:45:19,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:45:19,209 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:45:19,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [87380068] [2022-07-22 10:45:19,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:45:19,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:45:19,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:45:19,211 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) [2022-07-22 10:45:19,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 10:45:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:45:19,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-22 10:45:19,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:45:19,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:45:19,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:19,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67 [2022-07-22 10:45:19,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 99 [2022-07-22 10:45:19,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:19,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 9 [2022-07-22 10:45:19,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:19,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-07-22 10:45:19,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:19,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-07-22 10:45:19,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:19,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-07-22 10:45:19,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:19,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-07-22 10:45:19,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:19,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-07-22 10:45:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:45:19,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:45:25,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:45:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:45:25,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:45:25,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990178912] [2022-07-22 10:45:25,181 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:45:25,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87380068] [2022-07-22 10:45:25,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87380068] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:45:25,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:45:25,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2022-07-22 10:45:25,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672746817] [2022-07-22 10:45:25,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:45:25,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 10:45:25,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:45:25,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 10:45:25,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=240, Unknown=1, NotChecked=0, Total=306 [2022-07-22 10:45:25,184 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:45:27,767 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2022-07-22 10:45:27,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 10:45:27,767 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-22 10:45:27,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:45:27,769 INFO L225 Difference]: With dead ends: 80 [2022-07-22 10:45:27,770 INFO L226 Difference]: Without dead ends: 75 [2022-07-22 10:45:27,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=148, Invalid=501, Unknown=1, NotChecked=0, Total=650 [2022-07-22 10:45:27,771 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:45:27,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 56 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 248 Invalid, 0 Unknown, 48 Unchecked, 1.0s Time] [2022-07-22 10:45:27,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-22 10:45:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2022-07-22 10:45:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-07-22 10:45:27,788 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 27 [2022-07-22 10:45:27,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:45:27,789 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2022-07-22 10:45:27,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:27,790 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2022-07-22 10:45:27,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 10:45:27,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:45:27,791 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:45:27,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 10:45:28,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:45:28,008 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:45:28,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:45:28,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1190930620, now seen corresponding path program 2 times [2022-07-22 10:45:28,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:45:28,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188641965] [2022-07-22 10:45:28,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:45:28,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:45:28,029 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:45:28,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1610807696] [2022-07-22 10:45:28,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:45:28,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:45:28,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:45:28,058 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) [2022-07-22 10:45:28,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 10:45:28,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:45:28,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:45:28,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:45:28,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:45:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 10:45:28,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:45:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 10:45:28,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:45:28,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188641965] [2022-07-22 10:45:28,150 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:45:28,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610807696] [2022-07-22 10:45:28,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610807696] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:45:28,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:45:28,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-22 10:45:28,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407220967] [2022-07-22 10:45:28,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:45:28,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 10:45:28,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:45:28,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 10:45:28,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-22 10:45:28,153 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:45:28,287 INFO L93 Difference]: Finished difference Result 126 states and 150 transitions. [2022-07-22 10:45:28,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:45:28,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-22 10:45:28,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:45:28,289 INFO L225 Difference]: With dead ends: 126 [2022-07-22 10:45:28,289 INFO L226 Difference]: Without dead ends: 65 [2022-07-22 10:45:28,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-22 10:45:28,296 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 74 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:45:28,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 33 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:45:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-22 10:45:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2022-07-22 10:45:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-07-22 10:45:28,311 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 29 [2022-07-22 10:45:28,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:45:28,312 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-07-22 10:45:28,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-07-22 10:45:28,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 10:45:28,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:45:28,316 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:45:28,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 10:45:28,545 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,SelfDestructingSolverStorable3 [2022-07-22 10:45:28,546 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:45:28,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:45:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash 264308668, now seen corresponding path program 3 times [2022-07-22 10:45:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:45:28,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810411187] [2022-07-22 10:45:28,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:45:28,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:45:28,559 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:45:28,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [7615352] [2022-07-22 10:45:28,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:45:28,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:45:28,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:45:28,563 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) [2022-07-22 10:45:28,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 10:45:28,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 10:45:28,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:45:28,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:45:28,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:45:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 10:45:28,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:45:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 10:45:28,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:45:28,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810411187] [2022-07-22 10:45:28,693 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:45:28,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7615352] [2022-07-22 10:45:28,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7615352] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:45:28,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:45:28,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-22 10:45:28,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152129793] [2022-07-22 10:45:28,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:45:28,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 10:45:28,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:45:28,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 10:45:28,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-22 10:45:28,695 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:45:28,824 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-07-22 10:45:28,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:45:28,825 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-22 10:45:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:45:28,826 INFO L225 Difference]: With dead ends: 58 [2022-07-22 10:45:28,826 INFO L226 Difference]: Without dead ends: 42 [2022-07-22 10:45:28,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:45:28,829 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:45:28,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 18 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:45:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-22 10:45:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-07-22 10:45:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-07-22 10:45:28,836 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2022-07-22 10:45:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:45:28,836 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-07-22 10:45:28,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:28,837 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-07-22 10:45:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 10:45:28,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:45:28,839 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:45:28,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 10:45:29,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:45:29,055 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:45:29,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:45:29,056 INFO L85 PathProgramCache]: Analyzing trace with hash 982389828, now seen corresponding path program 4 times [2022-07-22 10:45:29,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:45:29,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146752840] [2022-07-22 10:45:29,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:45:29,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:45:29,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:45:29,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564463017] [2022-07-22 10:45:29,072 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:45:29,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:45:29,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:45:29,077 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) [2022-07-22 10:45:29,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 10:45:29,205 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:45:29,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:45:29,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-22 10:45:29,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:45:29,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:45:29,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:29,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67 [2022-07-22 10:45:29,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 99 [2022-07-22 10:45:29,257 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-22 10:45:29,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:29,300 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-22 10:45:29,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-22 10:45:29,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:29,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 116 [2022-07-22 10:45:29,424 INFO L356 Elim1Store]: treesize reduction 318, result has 10.2 percent of original size [2022-07-22 10:45:29,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 105 treesize of output 160 [2022-07-22 10:45:29,470 INFO L356 Elim1Store]: treesize reduction 327, result has 3.8 percent of original size [2022-07-22 10:45:29,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 105 treesize of output 49 [2022-07-22 10:45:29,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:29,534 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-22 10:45:29,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2022-07-22 10:45:29,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:29,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 112 [2022-07-22 10:45:29,642 INFO L356 Elim1Store]: treesize reduction 320, result has 9.6 percent of original size [2022-07-22 10:45:29,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 101 treesize of output 154 [2022-07-22 10:45:29,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:29,723 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-22 10:45:29,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2022-07-22 10:45:29,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:29,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 112 [2022-07-22 10:45:29,838 INFO L356 Elim1Store]: treesize reduction 320, result has 9.6 percent of original size [2022-07-22 10:45:29,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 101 treesize of output 154 [2022-07-22 10:45:29,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:29,931 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-22 10:45:29,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2022-07-22 10:45:30,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:30,008 INFO L356 Elim1Store]: treesize reduction 93, result has 1.1 percent of original size [2022-07-22 10:45:30,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 86 [2022-07-22 10:45:30,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:30,089 INFO L356 Elim1Store]: treesize reduction 93, result has 1.1 percent of original size [2022-07-22 10:45:30,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 86 [2022-07-22 10:45:30,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:30,254 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 10:45:30,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 30 [2022-07-22 10:45:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:45:30,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:46:26,855 WARN L233 SmtUtils]: Spent 17.85s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:47:40,262 WARN L233 SmtUtils]: Spent 39.36s on a formula simplification. DAG size of input: 92 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:47:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:47:40,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:47:40,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146752840] [2022-07-22 10:47:40,278 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:47:40,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564463017] [2022-07-22 10:47:40,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564463017] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:47:40,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:47:40,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 44 [2022-07-22 10:47:40,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157735752] [2022-07-22 10:47:40,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:47:40,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-22 10:47:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:47:40,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-22 10:47:40,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1680, Unknown=9, NotChecked=0, Total=1892 [2022-07-22 10:47:40,280 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 44 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 44 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:47:41,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-22 10:47:48,418 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse67 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse59 (* .cse67 8))) (let ((.cse58 (* (- 1) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (.cse43 (<= .cse67 2147483647)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse60 (+ .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse44 (* .cse2 .cse2))) (let ((.cse0 (<= 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (let ((.cse65 (store .cse8 .cse60 .cse44))) (let ((.cse63 (select .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse66 (select .cse65 .cse7))) (store (store (store (store (store (store .cse65 |c_ULTIMATE.start_main_~a~0#1.offset| .cse63) .cse7 (+ (- 1) .cse66)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse63) .cse7 (+ (- 2) .cse66)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse63) .cse7 (+ (- 3) .cse66)))))) (let ((.cse62 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse64 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse63 .cse64))))))) (.cse10 (< 2 c_~N~0)) (.cse11 (not .cse43)) (.cse18 (store .cse8 .cse60 (+ .cse58 (select .cse8 .cse60)))) (.cse36 (let ((.cse57 (+ .cse59 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (store .cse8 .cse57 (+ .cse58 (select .cse8 .cse57)))))) (and (or .cse0 (<= .cse1 .cse2)) (or (= c_~N~0 (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse9 (select .cse8 .cse7))) (store (store (store (store (store (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse7 (+ (- 1) .cse9)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse7 (+ .cse9 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse7 (+ .cse9 (- 3))))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5 .cse6)))))) .cse10) (or .cse10 (let ((.cse46 (mod .cse2 4294967296))) (let ((.cse22 (<= .cse46 2147483647)) (.cse45 (* .cse46 8))) (let ((.cse29 (+ .cse45 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse19 (+ .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse20 (* (- 1) .cse44)) (.cse21 (not .cse22))) (and (or .cse11 (and (or (= c_~N~0 (let ((.cse16 (store .cse18 .cse19 (+ (select .cse18 .cse19) .cse20)))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (select .cse16 .cse7))) (store (store (store (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| .cse14) .cse7 (+ (- 1) .cse17)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse14) .cse7 (+ (- 2) .cse17)))))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse14 .cse15))))))) .cse21) (or .cse22 (= c_~N~0 (let ((.cse27 (store .cse18 .cse29 (+ .cse20 (select .cse18 .cse29))))) (let ((.cse23 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse28 (select .cse27 .cse7))) (store (store (store (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| .cse23) .cse7 (+ .cse28 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse23) .cse7 (+ .cse28 (- 2))))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse26)))))))))) (or (and (or .cse22 (= c_~N~0 (let ((.cse34 (store .cse36 .cse29 (+ (select .cse36 .cse29) .cse20)))) (let ((.cse30 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (select .cse34 .cse7))) (store (store (store (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| .cse30) .cse7 (+ (- 1) .cse35)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse30) .cse7 (+ (- 2) .cse35)))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse33)))))))) (or (= c_~N~0 (let ((.cse41 (store .cse36 .cse19 (+ (select .cse36 .cse19) .cse20)))) (let ((.cse37 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse42 (select .cse41 .cse7))) (store (store (store (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| .cse37) .cse7 (+ (- 1) .cse42)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse37) .cse7 (+ (- 2) .cse42)))))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse37 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse40))))))) .cse21)) .cse43)))))) (or .cse0 (<= 2 .cse1)) (or .cse10 (and (or .cse11 (= (let ((.cse47 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse51 (select .cse18 .cse7))) (store (store (store (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| .cse47) .cse7 (+ (- 1) .cse51)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse47) .cse7 (+ (- 2) .cse51)))))) (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse47 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse50))))) c_~N~0)) (or .cse43 (= (let ((.cse55 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse56 (select .cse36 .cse7))) (store (store (store (store .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| .cse55) .cse7 (+ (- 1) .cse56)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse55) .cse7 (+ (- 2) .cse56)))))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse52 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse55))))) c_~N~0))))))))) is different from false [2022-07-22 10:47:50,433 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse67 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse59 (* .cse67 8))) (let ((.cse58 (* (- 1) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (.cse43 (<= .cse67 2147483647)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse60 (+ .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse44 (* .cse2 .cse2))) (let ((.cse0 (<= 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (let ((.cse65 (store .cse8 .cse60 .cse44))) (let ((.cse63 (select .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse66 (select .cse65 .cse7))) (store (store (store (store (store (store .cse65 |c_ULTIMATE.start_main_~a~0#1.offset| .cse63) .cse7 (+ (- 1) .cse66)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse63) .cse7 (+ (- 2) .cse66)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse63) .cse7 (+ (- 3) .cse66)))))) (let ((.cse62 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse64 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse63 .cse64))))))) (.cse10 (< 2 c_~N~0)) (.cse11 (not .cse43)) (.cse18 (store .cse8 .cse60 (+ .cse58 (select .cse8 .cse60)))) (.cse36 (let ((.cse57 (+ .cse59 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (store .cse8 .cse57 (+ .cse58 (select .cse8 .cse57)))))) (and (or .cse0 (<= .cse1 .cse2)) (or (= c_~N~0 (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse9 (select .cse8 .cse7))) (store (store (store (store (store (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse7 (+ (- 1) .cse9)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse7 (+ .cse9 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse7 (+ .cse9 (- 3))))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5 .cse6)))))) .cse10) (or .cse10 (let ((.cse46 (mod .cse2 4294967296))) (let ((.cse22 (<= .cse46 2147483647)) (.cse45 (* .cse46 8))) (let ((.cse29 (+ .cse45 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse19 (+ .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse20 (* (- 1) .cse44)) (.cse21 (not .cse22))) (and (or .cse11 (and (or (= c_~N~0 (let ((.cse16 (store .cse18 .cse19 (+ (select .cse18 .cse19) .cse20)))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (select .cse16 .cse7))) (store (store (store (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| .cse14) .cse7 (+ (- 1) .cse17)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse14) .cse7 (+ (- 2) .cse17)))))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse14 .cse15))))))) .cse21) (or .cse22 (= c_~N~0 (let ((.cse27 (store .cse18 .cse29 (+ .cse20 (select .cse18 .cse29))))) (let ((.cse23 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse28 (select .cse27 .cse7))) (store (store (store (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| .cse23) .cse7 (+ .cse28 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse23) .cse7 (+ .cse28 (- 2))))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse26)))))))))) (or (and (or .cse22 (= c_~N~0 (let ((.cse34 (store .cse36 .cse29 (+ (select .cse36 .cse29) .cse20)))) (let ((.cse30 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (select .cse34 .cse7))) (store (store (store (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| .cse30) .cse7 (+ (- 1) .cse35)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse30) .cse7 (+ (- 2) .cse35)))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse33)))))))) (or (= c_~N~0 (let ((.cse41 (store .cse36 .cse19 (+ (select .cse36 .cse19) .cse20)))) (let ((.cse37 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse42 (select .cse41 .cse7))) (store (store (store (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| .cse37) .cse7 (+ (- 1) .cse42)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse37) .cse7 (+ (- 2) .cse42)))))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse37 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse40))))))) .cse21)) .cse43)))))) (or .cse0 (<= 2 .cse1)) (or .cse10 (and (or .cse11 (= (let ((.cse47 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse51 (select .cse18 .cse7))) (store (store (store (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| .cse47) .cse7 (+ (- 1) .cse51)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse47) .cse7 (+ (- 2) .cse51)))))) (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse47 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse50))))) c_~N~0)) (or .cse43 (= (let ((.cse55 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse56 (select .cse36 .cse7))) (store (store (store (store .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| .cse55) .cse7 (+ (- 1) .cse56)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse55) .cse7 (+ (- 2) .cse56)))))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse52 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse55))))) c_~N~0))))))))) is different from true [2022-07-22 10:48:09,505 WARN L233 SmtUtils]: Spent 6.51s on a formula simplification. DAG size of input: 124 DAG size of output: 95 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:48:12,115 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse57 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse59 (mod .cse57 4294967296))) (let ((.cse19 (<= .cse59 2147483647)) (.cse58 (* .cse59 8))) (let ((.cse26 (+ .cse58 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (+ .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (* (- 1) (* .cse57 .cse57))) (.cse18 (not .cse19)) (.cse7 (< 2 c_~N~0))) (and (or (= c_~N~0 (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (select .cse5 .cse4))) (store (store (store (store (store (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse4 (+ (- 1) .cse6)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse4 (+ .cse6 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse4 (+ .cse6 (- 3))))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse2 .cse3)))))) .cse7) (or .cse7 (let ((.cse44 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse28 (* (- 1) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (.cse29 (* .cse44 8)) (.cse8 (<= .cse44 2147483647))) (and (or (not .cse8) (let ((.cse15 (let ((.cse27 (+ .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse5 .cse27 (+ .cse28 (select .cse5 .cse27)))))) (and (or (= c_~N~0 (let ((.cse13 (store .cse15 .cse16 (+ (select .cse15 .cse16) .cse17)))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse14 (select .cse13 .cse4))) (store (store (store (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| .cse11) .cse4 (+ (- 1) .cse14)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse11) .cse4 (+ (- 2) .cse14)))))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse11 .cse12))))))) .cse18) (or .cse19 (= c_~N~0 (let ((.cse24 (store .cse15 .cse26 (+ .cse17 (select .cse15 .cse26))))) (let ((.cse20 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse25 (select .cse24 .cse4))) (store (store (store (store .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| .cse20) .cse4 (+ .cse25 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse20) .cse4 (+ .cse25 (- 2))))))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse23))))))))))) (or (let ((.cse36 (let ((.cse43 (+ .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (store .cse5 .cse43 (+ .cse28 (select .cse5 .cse43)))))) (and (or .cse19 (= c_~N~0 (let ((.cse34 (store .cse36 .cse26 (+ (select .cse36 .cse26) .cse17)))) (let ((.cse30 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (select .cse34 .cse4))) (store (store (store (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| .cse30) .cse4 (+ (- 1) .cse35)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse30) .cse4 (+ (- 2) .cse35)))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse33)))))))) (or (= c_~N~0 (let ((.cse41 (store .cse36 .cse16 (+ (select .cse36 .cse16) .cse17)))) (let ((.cse37 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse42 (select .cse41 .cse4))) (store (store (store (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| .cse37) .cse4 (+ (- 1) .cse42)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse37) .cse4 (+ (- 2) .cse42)))))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse37 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse40))))))) .cse18))) .cse8))))) (or (and (or .cse19 (= (let ((.cse49 (store .cse5 .cse26 (+ .cse17 (select .cse5 .cse26))))) (let ((.cse45 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse50 (select .cse49 .cse4))) (store (store (store (store .cse49 |c_ULTIMATE.start_main_~a~0#1.offset| .cse45) .cse4 (+ (- 1) .cse50)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse45) .cse4 (+ (- 2) .cse50)))))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse46 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse45 .cse46 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) c_~N~0)) (or (= (let ((.cse55 (store .cse5 .cse16 (+ (select .cse5 .cse16) .cse17)))) (let ((.cse51 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse56 (select .cse55 .cse4))) (store (store (store (store .cse55 |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse4 (+ (- 1) .cse56)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse4 (+ (- 2) .cse56)))))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse51 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse54)))))) c_~N~0) .cse18)) .cse7)))))) is different from false [2022-07-22 10:49:14,404 WARN L233 SmtUtils]: Spent 14.85s on a formula simplification. DAG size of input: 261 DAG size of output: 110 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:49:16,188 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-22 10:49:21,441 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse156 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse158 (* .cse156 8)) (.cse155 (mod .cse2 4294967296))) (let ((.cse157 (* .cse155 8)) (.cse145 (+ .cse158 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse63 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse142 (+ .cse158 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (let ((.cse144 (select .cse63 .cse142)) (.cse154 (* (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (.cse146 (select .cse63 .cse145)) (.cse29 (+ .cse157 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse19 (+ .cse157 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (select .cse63 .cse7)) (.cse71 (select .cse63 .cse19)) (.cse64 (select .cse63 .cse29)) (.cse48 (store .cse63 .cse145 (+ .cse154 .cse146))) (.cse53 (store .cse63 .cse142 (+ .cse154 .cse144)))) (let ((.cse143 (* (- 1) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (.cse43 (<= .cse156 2147483647)) (.cse86 (store .cse53 .cse29 (+ (- 1) (select .cse53 .cse29) .cse154))) (.cse22 (<= .cse155 2147483647)) (.cse91 (store .cse53 .cse19 (+ (- 1) .cse154 (select .cse53 .cse19)))) (.cse81 (store .cse48 .cse19 (+ (- 1) .cse154 (select .cse48 .cse19)))) (.cse76 (store .cse48 .cse29 (+ (- 1) (select .cse48 .cse29) .cse154))) (.cse102 (store .cse63 .cse29 (+ (- 1) .cse154 .cse64))) (.cse107 (store .cse63 .cse19 (+ (- 1) .cse71 .cse154))) (.cse153 (* .cse2 .cse2)) (.cse131 (store (store .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse7 (+ (- 1) .cse9)))) (let ((.cse8 (store (store .cse131 |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse7 (+ .cse9 (- 2)))) (.cse20 (* (- 1) .cse153)) (.cse45 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse51 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (<= 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (let ((.cse151 (store .cse63 .cse145 .cse153))) (let ((.cse149 (select .cse151 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse147 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse152 (select .cse151 .cse7))) (store (store (store (store (store (store .cse151 |c_ULTIMATE.start_main_~a~0#1.offset| .cse149) .cse7 (+ (- 1) .cse152)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse149) .cse7 (+ (- 2) .cse152)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse149) .cse7 (+ (- 3) .cse152)))))) (let ((.cse148 (select .cse147 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse150 (select .cse148 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse148 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse149 .cse150))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse149 .cse150))))))) (.cse105 (select .cse107 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse101 (select .cse102 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse75 (select .cse76 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse79 (select .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse88 (select .cse91 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse21 (not .cse22)) (.cse82 (select .cse86 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (< 2 c_~N~0)) (.cse11 (not .cse43)) (.cse18 (store .cse63 .cse145 (+ .cse143 .cse146))) (.cse36 (store .cse63 .cse142 (+ .cse143 .cse144)))) (and (or .cse0 (<= .cse1 .cse2)) (or (= c_~N~0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse7 (+ .cse9 (- 3)))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5 .cse6))))) .cse10) (or .cse10 (and (or .cse11 (and (or (= c_~N~0 (let ((.cse16 (store .cse18 .cse19 (+ (select .cse18 .cse19) .cse20)))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (select .cse16 .cse7))) (store (store (store (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| .cse14) .cse7 (+ (- 1) .cse17)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse14) .cse7 (+ (- 2) .cse17)))))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse14 .cse15))))))) .cse21) (or .cse22 (= c_~N~0 (let ((.cse27 (store .cse18 .cse29 (+ .cse20 (select .cse18 .cse29))))) (let ((.cse23 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse28 (select .cse27 .cse7))) (store (store (store (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| .cse23) .cse7 (+ .cse28 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse23) .cse7 (+ .cse28 (- 2))))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse26)))))))))) (or (and (or .cse22 (= c_~N~0 (let ((.cse34 (store .cse36 .cse29 (+ (select .cse36 .cse29) .cse20)))) (let ((.cse30 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (select .cse34 .cse7))) (store (store (store (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| .cse30) .cse7 (+ (- 1) .cse35)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse30) .cse7 (+ (- 2) .cse35)))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse33)))))))) (or (= c_~N~0 (let ((.cse41 (store .cse36 .cse19 (+ (select .cse36 .cse19) .cse20)))) (let ((.cse37 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse42 (select .cse41 .cse7))) (store (store (store (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| .cse37) .cse7 (+ (- 1) .cse42)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse37) .cse7 (+ (- 2) .cse42)))))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse37 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse40))))))) .cse21)) .cse43))) (or (and (or .cse11 (= c_~N~0 (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| .cse45) .cse7 (+ (- 1) (select .cse48 .cse7)))))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse44 .cse45 (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) (or .cse43 (= c_~N~0 (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse53 |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse7 (+ (- 1) (select .cse53 .cse7)))))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse51 .cse52))))))) .cse10) (or (= c_~N~0 (let ((.cse55 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8))) (let ((.cse56 (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (select .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse54 (select (select (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse6))))) .cse10) (or (and (or .cse22 (= (let ((.cse61 (store .cse63 .cse29 (+ .cse20 .cse64)))) (let ((.cse57 (select .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse62 (select .cse61 .cse7))) (store (store (store (store .cse61 |c_ULTIMATE.start_main_~a~0#1.offset| .cse57) .cse7 (+ (- 1) .cse62)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse57) .cse7 (+ (- 2) .cse62)))))) (let ((.cse60 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse57 .cse58 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) c_~N~0)) (or (= (let ((.cse69 (store .cse63 .cse19 (+ .cse71 .cse20)))) (let ((.cse65 (select .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse70 (select .cse69 .cse7))) (store (store (store (store .cse69 |c_ULTIMATE.start_main_~a~0#1.offset| .cse65) .cse7 (+ (- 1) .cse70)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse65) .cse7 (+ (- 2) .cse70)))))) (let ((.cse67 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse65 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse68)))))) c_~N~0) .cse21)) .cse10) (or .cse10 (and (or (and (or .cse22 (= c_~N~0 (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse76 |c_ULTIMATE.start_main_~a~0#1.offset| .cse75) .cse7 (+ (- 1) (select .cse76 .cse7)))))) (let ((.cse74 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse72 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse72 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse75)))))) (or .cse21 (= c_~N~0 (let ((.cse77 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse81 |c_ULTIMATE.start_main_~a~0#1.offset| .cse79) .cse7 (+ (- 1) (select .cse81 .cse7)))))) (let ((.cse78 (select .cse77 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse80 (select .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse79 .cse80))))))) .cse11) (or .cse43 (and (or .cse22 (= c_~N~0 (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse86 |c_ULTIMATE.start_main_~a~0#1.offset| .cse82) .cse7 (+ (- 1) (select .cse86 .cse7)))))) (let ((.cse84 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse85 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse82 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse85)))))) (or (= (let ((.cse89 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse91 |c_ULTIMATE.start_main_~a~0#1.offset| .cse88) .cse7 (+ (- 1) (select .cse91 .cse7)))))) (let ((.cse90 (select .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse87 (select .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse87 .cse88 (select (select (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) c_~N~0) .cse21))))) (or .cse10 (and (or .cse11 (= c_~N~0 (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse48))) (let ((.cse93 (select .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse94 (select .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse94 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse94 .cse45)))))) (or (= c_~N~0 (let ((.cse95 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse53))) (let ((.cse96 (select .cse95 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse97 (select .cse96 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse95 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse96 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse97))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse51 .cse97))))) .cse43))) (or (and (or .cse22 (= (let ((.cse98 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse102 |c_ULTIMATE.start_main_~a~0#1.offset| .cse101) .cse7 (+ (- 1) (select .cse102 .cse7)))))) (let ((.cse99 (select .cse98 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse100 (select .cse99 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse99 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse100 .cse101))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse100 .cse101)))) c_~N~0)) (or .cse21 (= c_~N~0 (let ((.cse103 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse107 |c_ULTIMATE.start_main_~a~0#1.offset| .cse105) .cse7 (+ (- 1) (select .cse107 .cse7)))))) (let ((.cse104 (select .cse103 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse106 (select .cse104 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse103 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse104 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse105 .cse106))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse105 .cse106))))))) .cse10) (or .cse0 (<= 2 .cse1)) (or .cse10 (= c_~N~0 (let ((.cse109 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse108 (select .cse109 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse108 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse109 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse108 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse6))))) (or (and (or .cse21 (= c_~N~0 (let ((.cse111 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse107))) (let ((.cse112 (select .cse111 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse110 (select .cse112 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse110 .cse105 (select (select (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse112 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse110 .cse105))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) (or .cse22 (= c_~N~0 (let ((.cse113 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse102))) (let ((.cse114 (select .cse113 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse115 (select .cse114 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse113 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse114 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse115 .cse101))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse115 .cse101))))))) .cse10) (or (and (or .cse11 (and (or .cse22 (= c_~N~0 (let ((.cse116 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse76))) (let ((.cse117 (select .cse116 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse118 (select .cse117 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse116 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse117 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse118 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse118 .cse75)))))) (or (= c_~N~0 (let ((.cse119 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse81))) (let ((.cse120 (select .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse121 (select .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse121))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse79 .cse121))))) .cse21))) (or (and (or (= c_~N~0 (let ((.cse123 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse91))) (let ((.cse124 (select .cse123 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse122 (select .cse124 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse88 .cse122 (select (select (store .cse123 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse124 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse122))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) .cse21) (or .cse22 (= c_~N~0 (let ((.cse125 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse86))) (let ((.cse126 (select .cse125 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse127 (select .cse126 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse125 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse126 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse127))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse82 .cse127))))))) .cse43)) .cse10) (or .cse10 (= c_~N~0 (let ((.cse128 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse131))) (let ((.cse129 (select .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse130 (select .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse130))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse6 .cse130)))))) (or .cse10 (and (or .cse11 (= (let ((.cse132 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse133 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse136 (select .cse18 .cse7))) (store (store (store (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| .cse132) .cse7 (+ (- 1) .cse136)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse132) .cse7 (+ (- 2) .cse136)))))) (let ((.cse134 (select .cse133 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse135 (select .cse134 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse132 (select (select (store .cse133 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse132 .cse135))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse135))))) c_~N~0)) (or .cse43 (= (let ((.cse140 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse138 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse141 (select .cse36 .cse7))) (store (store (store (store .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| .cse140) .cse7 (+ (- 1) .cse141)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse140) .cse7 (+ (- 2) .cse141)))))) (let ((.cse139 (select .cse138 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse137 (select .cse139 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse137 (select (select (store .cse138 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse139 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse137 .cse140))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse140))))) c_~N~0)))))))))))) is different from false [2022-07-22 10:49:23,459 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse156 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse158 (* .cse156 8)) (.cse155 (mod .cse2 4294967296))) (let ((.cse157 (* .cse155 8)) (.cse145 (+ .cse158 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse63 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse142 (+ .cse158 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (let ((.cse144 (select .cse63 .cse142)) (.cse154 (* (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (.cse146 (select .cse63 .cse145)) (.cse29 (+ .cse157 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse19 (+ .cse157 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (select .cse63 .cse7)) (.cse71 (select .cse63 .cse19)) (.cse64 (select .cse63 .cse29)) (.cse48 (store .cse63 .cse145 (+ .cse154 .cse146))) (.cse53 (store .cse63 .cse142 (+ .cse154 .cse144)))) (let ((.cse143 (* (- 1) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (.cse43 (<= .cse156 2147483647)) (.cse86 (store .cse53 .cse29 (+ (- 1) (select .cse53 .cse29) .cse154))) (.cse22 (<= .cse155 2147483647)) (.cse91 (store .cse53 .cse19 (+ (- 1) .cse154 (select .cse53 .cse19)))) (.cse81 (store .cse48 .cse19 (+ (- 1) .cse154 (select .cse48 .cse19)))) (.cse76 (store .cse48 .cse29 (+ (- 1) (select .cse48 .cse29) .cse154))) (.cse102 (store .cse63 .cse29 (+ (- 1) .cse154 .cse64))) (.cse107 (store .cse63 .cse19 (+ (- 1) .cse71 .cse154))) (.cse153 (* .cse2 .cse2)) (.cse131 (store (store .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse7 (+ (- 1) .cse9)))) (let ((.cse8 (store (store .cse131 |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse7 (+ .cse9 (- 2)))) (.cse20 (* (- 1) .cse153)) (.cse45 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse51 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (<= 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (let ((.cse151 (store .cse63 .cse145 .cse153))) (let ((.cse149 (select .cse151 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse147 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse152 (select .cse151 .cse7))) (store (store (store (store (store (store .cse151 |c_ULTIMATE.start_main_~a~0#1.offset| .cse149) .cse7 (+ (- 1) .cse152)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse149) .cse7 (+ (- 2) .cse152)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse149) .cse7 (+ (- 3) .cse152)))))) (let ((.cse148 (select .cse147 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse150 (select .cse148 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse147 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse148 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse149 .cse150))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse149 .cse150))))))) (.cse105 (select .cse107 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse101 (select .cse102 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse75 (select .cse76 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse79 (select .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse88 (select .cse91 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse21 (not .cse22)) (.cse82 (select .cse86 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (< 2 c_~N~0)) (.cse11 (not .cse43)) (.cse18 (store .cse63 .cse145 (+ .cse143 .cse146))) (.cse36 (store .cse63 .cse142 (+ .cse143 .cse144)))) (and (or .cse0 (<= .cse1 .cse2)) (or (= c_~N~0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse7 (+ .cse9 (- 3)))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5 .cse6))))) .cse10) (or .cse10 (and (or .cse11 (and (or (= c_~N~0 (let ((.cse16 (store .cse18 .cse19 (+ (select .cse18 .cse19) .cse20)))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (select .cse16 .cse7))) (store (store (store (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| .cse14) .cse7 (+ (- 1) .cse17)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse14) .cse7 (+ (- 2) .cse17)))))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse14 .cse15))))))) .cse21) (or .cse22 (= c_~N~0 (let ((.cse27 (store .cse18 .cse29 (+ .cse20 (select .cse18 .cse29))))) (let ((.cse23 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse28 (select .cse27 .cse7))) (store (store (store (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| .cse23) .cse7 (+ .cse28 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse23) .cse7 (+ .cse28 (- 2))))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse26)))))))))) (or (and (or .cse22 (= c_~N~0 (let ((.cse34 (store .cse36 .cse29 (+ (select .cse36 .cse29) .cse20)))) (let ((.cse30 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (select .cse34 .cse7))) (store (store (store (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| .cse30) .cse7 (+ (- 1) .cse35)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse30) .cse7 (+ (- 2) .cse35)))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse33)))))))) (or (= c_~N~0 (let ((.cse41 (store .cse36 .cse19 (+ (select .cse36 .cse19) .cse20)))) (let ((.cse37 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse42 (select .cse41 .cse7))) (store (store (store (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| .cse37) .cse7 (+ (- 1) .cse42)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse37) .cse7 (+ (- 2) .cse42)))))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse37 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse40))))))) .cse21)) .cse43))) (or (and (or .cse11 (= c_~N~0 (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| .cse45) .cse7 (+ (- 1) (select .cse48 .cse7)))))) (let ((.cse47 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse44 .cse45 (select (select (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) (or .cse43 (= c_~N~0 (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse53 |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse7 (+ (- 1) (select .cse53 .cse7)))))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse51 .cse52))))))) .cse10) (or (= c_~N~0 (let ((.cse55 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8))) (let ((.cse56 (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (select .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse54 (select (select (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse6))))) .cse10) (or (and (or .cse22 (= (let ((.cse61 (store .cse63 .cse29 (+ .cse20 .cse64)))) (let ((.cse57 (select .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse62 (select .cse61 .cse7))) (store (store (store (store .cse61 |c_ULTIMATE.start_main_~a~0#1.offset| .cse57) .cse7 (+ (- 1) .cse62)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse57) .cse7 (+ (- 2) .cse62)))))) (let ((.cse60 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse57 .cse58 (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) c_~N~0)) (or (= (let ((.cse69 (store .cse63 .cse19 (+ .cse71 .cse20)))) (let ((.cse65 (select .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse70 (select .cse69 .cse7))) (store (store (store (store .cse69 |c_ULTIMATE.start_main_~a~0#1.offset| .cse65) .cse7 (+ (- 1) .cse70)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse65) .cse7 (+ (- 2) .cse70)))))) (let ((.cse67 (select .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse65 (select (select (store .cse66 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse65 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse68)))))) c_~N~0) .cse21)) .cse10) (or .cse10 (and (or (and (or .cse22 (= c_~N~0 (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse76 |c_ULTIMATE.start_main_~a~0#1.offset| .cse75) .cse7 (+ (- 1) (select .cse76 .cse7)))))) (let ((.cse74 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse72 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse72 (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse75)))))) (or .cse21 (= c_~N~0 (let ((.cse77 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse81 |c_ULTIMATE.start_main_~a~0#1.offset| .cse79) .cse7 (+ (- 1) (select .cse81 .cse7)))))) (let ((.cse78 (select .cse77 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse80 (select .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse77 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse78 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse79 .cse80))))))) .cse11) (or .cse43 (and (or .cse22 (= c_~N~0 (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse86 |c_ULTIMATE.start_main_~a~0#1.offset| .cse82) .cse7 (+ (- 1) (select .cse86 .cse7)))))) (let ((.cse84 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse85 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse82 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse85)))))) (or (= (let ((.cse89 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse91 |c_ULTIMATE.start_main_~a~0#1.offset| .cse88) .cse7 (+ (- 1) (select .cse91 .cse7)))))) (let ((.cse90 (select .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse87 (select .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse87 .cse88 (select (select (store .cse89 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse90 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) c_~N~0) .cse21))))) (or .cse10 (and (or .cse11 (= c_~N~0 (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse48))) (let ((.cse93 (select .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse94 (select .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse92 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse93 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse94 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse94 .cse45)))))) (or (= c_~N~0 (let ((.cse95 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse53))) (let ((.cse96 (select .cse95 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse97 (select .cse96 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse95 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse96 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse97))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse51 .cse97))))) .cse43))) (or (and (or .cse22 (= (let ((.cse98 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse102 |c_ULTIMATE.start_main_~a~0#1.offset| .cse101) .cse7 (+ (- 1) (select .cse102 .cse7)))))) (let ((.cse99 (select .cse98 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse100 (select .cse99 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse98 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse99 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse100 .cse101))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse100 .cse101)))) c_~N~0)) (or .cse21 (= c_~N~0 (let ((.cse103 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse107 |c_ULTIMATE.start_main_~a~0#1.offset| .cse105) .cse7 (+ (- 1) (select .cse107 .cse7)))))) (let ((.cse104 (select .cse103 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse106 (select .cse104 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse103 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse104 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse105 .cse106))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse105 .cse106))))))) .cse10) (or .cse0 (<= 2 .cse1)) (or .cse10 (= c_~N~0 (let ((.cse109 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse108 (select .cse109 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse108 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse109 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse108 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse6))))) (or (and (or .cse21 (= c_~N~0 (let ((.cse111 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse107))) (let ((.cse112 (select .cse111 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse110 (select .cse112 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse110 .cse105 (select (select (store .cse111 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse112 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse110 .cse105))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))))) (or .cse22 (= c_~N~0 (let ((.cse113 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse102))) (let ((.cse114 (select .cse113 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse115 (select .cse114 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse113 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse114 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse115 .cse101))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse115 .cse101))))))) .cse10) (or (and (or .cse11 (and (or .cse22 (= c_~N~0 (let ((.cse116 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse76))) (let ((.cse117 (select .cse116 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse118 (select .cse117 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse116 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse117 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse118 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse118 .cse75)))))) (or (= c_~N~0 (let ((.cse119 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse81))) (let ((.cse120 (select .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse121 (select .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse119 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse120 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse121))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse79 .cse121))))) .cse21))) (or (and (or (= c_~N~0 (let ((.cse123 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse91))) (let ((.cse124 (select .cse123 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse122 (select .cse124 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse88 .cse122 (select (select (store .cse123 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse124 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse88 .cse122))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)))))) .cse21) (or .cse22 (= c_~N~0 (let ((.cse125 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse86))) (let ((.cse126 (select .cse125 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse127 (select .cse126 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse125 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse126 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse127))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse82 .cse127))))))) .cse43)) .cse10) (or .cse10 (= c_~N~0 (let ((.cse128 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse131))) (let ((.cse129 (select .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse130 (select .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse128 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse129 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse130))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse6 .cse130)))))) (or .cse10 (and (or .cse11 (= (let ((.cse132 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse133 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse136 (select .cse18 .cse7))) (store (store (store (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| .cse132) .cse7 (+ (- 1) .cse136)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse132) .cse7 (+ (- 2) .cse136)))))) (let ((.cse134 (select .cse133 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse135 (select .cse134 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse132 (select (select (store .cse133 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse134 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse132 .cse135))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse135))))) c_~N~0)) (or .cse43 (= (let ((.cse140 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse138 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse141 (select .cse36 .cse7))) (store (store (store (store .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| .cse140) .cse7 (+ (- 1) .cse141)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse140) .cse7 (+ (- 2) .cse141)))))) (let ((.cse139 (select .cse138 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse137 (select .cse139 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse137 (select (select (store .cse138 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse139 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse137 .cse140))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse140))))) c_~N~0)))))))))))) is different from true [2022-07-22 10:49:38,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-22 10:49:39,942 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-22 10:49:43,875 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers []