./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/splice-2.i --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/list-properties/splice-2.i -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 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:37:20,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:37:20,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:37:20,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:37:20,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:37:20,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:37:20,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:37:20,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:37:20,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:37:20,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:37:20,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:37:20,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:37:20,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:37:20,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:37:20,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:37:20,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:37:20,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:37:20,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:37:20,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:37:20,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:37:20,142 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:37:20,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:37:20,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:37:20,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:37:20,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:37:20,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:37:20,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:37:20,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:37:20,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:37:20,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:37:20,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:37:20,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:37:20,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:37:20,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:37:20,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:37:20,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:37:20,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:37:20,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:37:20,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:37:20,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:37:20,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:37:20,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:37:20,159 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:37:20,176 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:37:20,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:37:20,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:37:20,177 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:37:20,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:37:20,178 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:37:20,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:37:20,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:37:20,179 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:37:20,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:37:20,180 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:37:20,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:37:20,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:37:20,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:37:20,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:37:20,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:37:20,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:37:20,181 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:37:20,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:37:20,181 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:37:20,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:37:20,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:37:20,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:37:20,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:37:20,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:37:20,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:37:20,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:37:20,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:37:20,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:37:20,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:37:20,184 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:37:20,184 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:37:20,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:37:20,184 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 -> 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc [2022-07-22 14:37:20,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:37:20,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:37:20,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:37:20,441 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:37:20,441 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:37:20,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/splice-2.i [2022-07-22 14:37:20,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a11d4f1/a83c58a39c4d4e1bb50cc8f8186c6d83/FLAG33a724631 [2022-07-22 14:37:20,918 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:37:20,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/splice-2.i [2022-07-22 14:37:20,937 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a11d4f1/a83c58a39c4d4e1bb50cc8f8186c6d83/FLAG33a724631 [2022-07-22 14:37:20,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a11d4f1/a83c58a39c4d4e1bb50cc8f8186c6d83 [2022-07-22 14:37:20,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:37:20,959 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:37:20,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:37:20,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:37:20,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:37:20,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:37:20" (1/1) ... [2022-07-22 14:37:20,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4d19a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:20, skipping insertion in model container [2022-07-22 14:37:20,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:37:20" (1/1) ... [2022-07-22 14:37:20,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:37:21,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:37:21,264 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/list-properties/splice-2.i[23721,23734] [2022-07-22 14:37:21,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:37:21,275 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:37:21,321 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/list-properties/splice-2.i[23721,23734] [2022-07-22 14:37:21,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:37:21,342 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:37:21,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:21 WrapperNode [2022-07-22 14:37:21,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:37:21,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:37:21,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:37:21,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:37:21,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:21" (1/1) ... [2022-07-22 14:37:21,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:21" (1/1) ... [2022-07-22 14:37:21,368 INFO L137 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 104 [2022-07-22 14:37:21,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:37:21,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:37:21,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:37:21,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:37:21,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:21" (1/1) ... [2022-07-22 14:37:21,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:21" (1/1) ... [2022-07-22 14:37:21,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:21" (1/1) ... [2022-07-22 14:37:21,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:21" (1/1) ... [2022-07-22 14:37:21,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:21" (1/1) ... [2022-07-22 14:37:21,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:21" (1/1) ... [2022-07-22 14:37:21,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:21" (1/1) ... [2022-07-22 14:37:21,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:37:21,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:37:21,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:37:21,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:37:21,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:21" (1/1) ... [2022-07-22 14:37:21,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:37:21,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:37:21,439 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 14:37:21,451 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 14:37:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-22 14:37:21,468 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-22 14:37:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 14:37:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 14:37:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:37:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:37:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:37:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:37:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:37:21,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:37:21,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:37:21,549 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:37:21,550 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:37:21,580 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-22 14:37:21,688 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:37:21,692 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:37:21,692 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 14:37:21,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:37:21 BoogieIcfgContainer [2022-07-22 14:37:21,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:37:21,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:37:21,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:37:21,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:37:21,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:37:20" (1/3) ... [2022-07-22 14:37:21,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bed8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:37:21, skipping insertion in model container [2022-07-22 14:37:21,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:37:21" (2/3) ... [2022-07-22 14:37:21,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bed8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:37:21, skipping insertion in model container [2022-07-22 14:37:21,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:37:21" (3/3) ... [2022-07-22 14:37:21,699 INFO L111 eAbstractionObserver]: Analyzing ICFG splice-2.i [2022-07-22 14:37:21,707 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:37:21,707 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:37:21,736 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:37:21,740 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@d2ca3f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@303c678e [2022-07-22 14:37:21,740 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:37:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 14:37:21,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:21,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:37:21,748 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:21,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:21,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1192551972, now seen corresponding path program 1 times [2022-07-22 14:37:21,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:37:21,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392098787] [2022-07-22 14:37:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:21,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:37:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:21,864 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 14:37:21,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:37:21,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392098787] [2022-07-22 14:37:21,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392098787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:37:21,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:37:21,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:37:21,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647588630] [2022-07-22 14:37:21,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:37:21,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:37:21,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:37:21,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:37:21,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:37:21,897 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 14:37:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:37:21,909 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2022-07-22 14:37:21,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:37:21,911 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-07-22 14:37:21,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:37:21,915 INFO L225 Difference]: With dead ends: 48 [2022-07-22 14:37:21,915 INFO L226 Difference]: Without dead ends: 23 [2022-07-22 14:37:21,917 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 14:37:21,922 INFO L413 NwaCegarLoop]: 40 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, 40 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 14:37:21,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:37:21,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-22 14:37:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-22 14:37:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-07-22 14:37:21,948 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-07-22 14:37:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:37:21,949 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-07-22 14:37:21,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 14:37:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-07-22 14:37:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 14:37:21,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:21,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:37:21,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:37:21,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:21,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:21,954 INFO L85 PathProgramCache]: Analyzing trace with hash 675462707, now seen corresponding path program 1 times [2022-07-22 14:37:21,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:37:21,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825083406] [2022-07-22 14:37:21,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:21,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:37:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:22,052 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 14:37:22,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:37:22,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825083406] [2022-07-22 14:37:22,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825083406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:37:22,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:37:22,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:37:22,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871344352] [2022-07-22 14:37:22,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:37:22,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:37:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:37:22,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:37:22,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:37:22,055 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14:37:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:37:22,098 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-07-22 14:37:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:37:22,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-22 14:37:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:37:22,099 INFO L225 Difference]: With dead ends: 40 [2022-07-22 14:37:22,099 INFO L226 Difference]: Without dead ends: 33 [2022-07-22 14:37:22,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:37:22,104 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:37:22,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:37:22,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-22 14:37:22,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-07-22 14:37:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-07-22 14:37:22,110 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2022-07-22 14:37:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:37:22,111 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-07-22 14:37:22,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14:37:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-07-22 14:37:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 14:37:22,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:22,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:37:22,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 14:37:22,112 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:22,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:22,113 INFO L85 PathProgramCache]: Analyzing trace with hash 577924040, now seen corresponding path program 1 times [2022-07-22 14:37:22,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:37:22,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275450431] [2022-07-22 14:37:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:37:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:22,155 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 14:37:22,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:37:22,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275450431] [2022-07-22 14:37:22,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275450431] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:37:22,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:37:22,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:37:22,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784621887] [2022-07-22 14:37:22,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:37:22,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:37:22,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:37:22,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:37:22,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:37:22,157 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:37:22,188 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-07-22 14:37:22,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:37:22,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-22 14:37:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:37:22,190 INFO L225 Difference]: With dead ends: 47 [2022-07-22 14:37:22,190 INFO L226 Difference]: Without dead ends: 39 [2022-07-22 14:37:22,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:37:22,191 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:37:22,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:37:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-22 14:37:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-07-22 14:37:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 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 14:37:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-07-22 14:37:22,196 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 16 [2022-07-22 14:37:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:37:22,196 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-07-22 14:37:22,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-07-22 14:37:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 14:37:22,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:22,197 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:37:22,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 14:37:22,197 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:22,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:22,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1645466066, now seen corresponding path program 1 times [2022-07-22 14:37:22,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:37:22,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966025239] [2022-07-22 14:37:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:22,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:37:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:22,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:37:22,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966025239] [2022-07-22 14:37:22,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966025239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:37:22,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:37:22,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 14:37:22,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176760004] [2022-07-22 14:37:22,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:37:22,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 14:37:22,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:37:22,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 14:37:22,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:37:22,251 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 14:37:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:37:22,326 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2022-07-22 14:37:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:37:22,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 14:37:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:37:22,327 INFO L225 Difference]: With dead ends: 70 [2022-07-22 14:37:22,327 INFO L226 Difference]: Without dead ends: 43 [2022-07-22 14:37:22,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-22 14:37:22,328 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:37:22,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 78 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:37:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-22 14:37:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-22 14:37:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 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 14:37:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-07-22 14:37:22,332 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 17 [2022-07-22 14:37:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:37:22,332 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-07-22 14:37:22,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 14:37:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-07-22 14:37:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 14:37:22,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:22,333 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] [2022-07-22 14:37:22,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 14:37:22,334 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:22,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:22,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1334445095, now seen corresponding path program 1 times [2022-07-22 14:37:22,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:37:22,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547747280] [2022-07-22 14:37:22,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:22,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:37:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:22,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:37:22,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547747280] [2022-07-22 14:37:22,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547747280] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:37:22,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634667364] [2022-07-22 14:37:22,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:22,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:37:22,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:37:22,592 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 14:37:22,593 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 14:37:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:22,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-22 14:37:22,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:37:22,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:37:22,812 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 14:37:22,858 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:37:22,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:37:22,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:22,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-22 14:37:22,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:37:22,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:22,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-22 14:37:23,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:37:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:23,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:37:23,037 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_102 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-22 14:37:23,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_98 Int) (v_ArrVal_102 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_98)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-22 14:37:23,150 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-22 14:37:23,151 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-22 14:37:23,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:23,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-22 14:37:23,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-22 14:37:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-22 14:37:23,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634667364] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:37:23,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:37:23,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-07-22 14:37:23,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544266171] [2022-07-22 14:37:23,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:37:23,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-22 14:37:23,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:37:23,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 14:37:23,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=389, Unknown=2, NotChecked=82, Total=552 [2022-07-22 14:37:23,273 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 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 14:37:27,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:37:27,859 INFO L93 Difference]: Finished difference Result 138 states and 177 transitions. [2022-07-22 14:37:27,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-22 14:37:27,859 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-22 14:37:27,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:37:27,860 INFO L225 Difference]: With dead ends: 138 [2022-07-22 14:37:27,860 INFO L226 Difference]: Without dead ends: 105 [2022-07-22 14:37:27,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=293, Invalid=1514, Unknown=7, NotChecked=166, Total=1980 [2022-07-22 14:37:27,861 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 98 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:37:27,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 259 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 344 Invalid, 0 Unknown, 165 Unchecked, 0.2s Time] [2022-07-22 14:37:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-22 14:37:27,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 61. [2022-07-22 14:37:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 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 14:37:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2022-07-22 14:37:27,867 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 23 [2022-07-22 14:37:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:37:27,867 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-07-22 14:37:27,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 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 14:37:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2022-07-22 14:37:27,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-22 14:37:27,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:27,868 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:37:27,891 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 14:37:28,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:37:28,080 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:28,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:28,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1115102530, now seen corresponding path program 1 times [2022-07-22 14:37:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:37:28,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243533359] [2022-07-22 14:37:28,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:28,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:37:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:28,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:37:28,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243533359] [2022-07-22 14:37:28,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243533359] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:37:28,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056157061] [2022-07-22 14:37:28,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:28,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:37:28,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:37:28,122 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 14:37:28,123 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 14:37:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:28,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 14:37:28,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:37:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 14:37:28,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:37:28,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056157061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:37:28,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 14:37:28,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-22 14:37:28,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707337219] [2022-07-22 14:37:28,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:37:28,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:37:28,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:37:28,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:37:28,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:37:28,212 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:37:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:37:28,228 INFO L93 Difference]: Finished difference Result 115 states and 149 transitions. [2022-07-22 14:37:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:37:28,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-22 14:37:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:37:28,231 INFO L225 Difference]: With dead ends: 115 [2022-07-22 14:37:28,232 INFO L226 Difference]: Without dead ends: 82 [2022-07-22 14:37:28,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:37:28,235 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:37:28,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 60 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:37:28,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-22 14:37:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2022-07-22 14:37:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 69 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2022-07-22 14:37:28,250 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 25 [2022-07-22 14:37:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:37:28,250 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2022-07-22 14:37:28,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:37:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2022-07-22 14:37:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-22 14:37:28,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:28,253 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:37:28,286 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 14:37:28,467 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,SelfDestructingSolverStorable5 [2022-07-22 14:37:28,473 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:28,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:28,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1793450878, now seen corresponding path program 1 times [2022-07-22 14:37:28,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:37:28,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124476662] [2022-07-22 14:37:28,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:28,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:37:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:28,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:37:28,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124476662] [2022-07-22 14:37:28,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124476662] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:37:28,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103490657] [2022-07-22 14:37:28,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:28,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:37:28,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:37:28,649 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 14:37:28,650 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 14:37:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:28,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-22 14:37:28,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:37:28,736 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 13 treesize of output 9 [2022-07-22 14:37:28,739 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 13 treesize of output 9 [2022-07-22 14:37:28,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 14:37:28,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 14:37:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 14:37:28,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:37:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 14:37:28,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103490657] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:37:28,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:37:28,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-07-22 14:37:28,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711011383] [2022-07-22 14:37:28,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:37:28,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 14:37:28,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:37:28,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 14:37:28,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-22 14:37:28,801 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:37:28,924 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-07-22 14:37:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 14:37:28,925 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-22 14:37:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:37:28,925 INFO L225 Difference]: With dead ends: 83 [2022-07-22 14:37:28,925 INFO L226 Difference]: Without dead ends: 75 [2022-07-22 14:37:28,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-07-22 14:37:28,926 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:37:28,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 111 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:37:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-22 14:37:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-22 14:37:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 71 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2022-07-22 14:37:28,930 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 25 [2022-07-22 14:37:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:37:28,930 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2022-07-22 14:37:28,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2022-07-22 14:37:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 14:37:28,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:28,931 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:37:28,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-22 14:37:29,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:37:29,147 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:29,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1425682976, now seen corresponding path program 1 times [2022-07-22 14:37:29,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:37:29,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774710069] [2022-07-22 14:37:29,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:29,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:37:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:29,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:37:29,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774710069] [2022-07-22 14:37:29,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774710069] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:37:29,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98808407] [2022-07-22 14:37:29,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:29,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:37:29,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:37:29,387 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 14:37:29,412 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 14:37:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:29,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-22 14:37:29,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:37:29,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:37:29,544 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:37:29,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:37:29,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:37:29,666 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 13 treesize of output 9 [2022-07-22 14:37:29,714 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:37:29,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-07-22 14:37:29,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-07-22 14:37:29,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-07-22 14:37:29,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:29,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-07-22 14:37:29,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:29,787 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2022-07-22 14:37:29,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:37:29,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:37:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:29,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:37:29,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-07-22 14:37:29,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_298) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2022-07-22 14:37:29,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_298) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 3)) is different from false [2022-07-22 14:37:29,938 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:29,938 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-07-22 14:37:29,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:29,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 78 [2022-07-22 14:37:29,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2022-07-22 14:37:29,970 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_297 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_ArrVal_295 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_297 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-22 14:37:29,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:29,999 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-22 14:37:30,004 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:30,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2022-07-22 14:37:30,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:37:30,035 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:30,035 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-22 14:37:30,040 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 14:37:30,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-07-22 14:37:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-22 14:37:30,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98808407] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:37:30,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:37:30,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 33 [2022-07-22 14:37:30,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838049080] [2022-07-22 14:37:30,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:37:30,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-22 14:37:30,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:37:30,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-22 14:37:30,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=741, Unknown=4, NotChecked=228, Total=1056 [2022-07-22 14:37:30,152 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 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 14:37:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:37:30,885 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-07-22 14:37:30,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 14:37:30,894 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 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) Word has length 26 [2022-07-22 14:37:30,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:37:30,895 INFO L225 Difference]: With dead ends: 103 [2022-07-22 14:37:30,895 INFO L226 Difference]: Without dead ends: 76 [2022-07-22 14:37:30,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=1777, Unknown=4, NotChecked=356, Total=2352 [2022-07-22 14:37:30,896 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 78 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:37:30,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 320 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 420 Invalid, 0 Unknown, 177 Unchecked, 0.2s Time] [2022-07-22 14:37:30,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-22 14:37:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2022-07-22 14:37:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 71 states have internal predecessors, (87), 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 14:37:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2022-07-22 14:37:30,900 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2022-07-22 14:37:30,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:37:30,901 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2022-07-22 14:37:30,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 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 14:37:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-07-22 14:37:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 14:37:30,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:30,902 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:37:30,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 14:37:31,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:37:31,102 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:31,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:31,103 INFO L85 PathProgramCache]: Analyzing trace with hash -154506453, now seen corresponding path program 2 times [2022-07-22 14:37:31,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:37:31,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974257082] [2022-07-22 14:37:31,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:31,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:37:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 14:37:31,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:37:31,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974257082] [2022-07-22 14:37:31,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974257082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:37:31,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:37:31,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:37:31,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568826051] [2022-07-22 14:37:31,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:37:31,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:37:31,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:37:31,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:37:31,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:37:31,148 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:31,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:37:31,157 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2022-07-22 14:37:31,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:37:31,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 14:37:31,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:37:31,158 INFO L225 Difference]: With dead ends: 126 [2022-07-22 14:37:31,158 INFO L226 Difference]: Without dead ends: 72 [2022-07-22 14:37:31,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:37:31,159 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:37:31,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:37:31,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-22 14:37:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2022-07-22 14:37:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-07-22 14:37:31,162 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 32 [2022-07-22 14:37:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:37:31,163 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-07-22 14:37:31,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:37:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-07-22 14:37:31,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 14:37:31,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:37:31,164 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:37:31,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 14:37:31,164 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:37:31,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:37:31,164 INFO L85 PathProgramCache]: Analyzing trace with hash -972154903, now seen corresponding path program 1 times [2022-07-22 14:37:31,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:37:31,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595942875] [2022-07-22 14:37:31,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:31,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:37:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:31,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:37:31,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595942875] [2022-07-22 14:37:31,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595942875] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:37:31,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832337689] [2022-07-22 14:37:31,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:37:31,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:37:31,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:37:31,486 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:37:31,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 14:37:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:37:31,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-22 14:37:31,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:37:31,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:37:31,627 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 14:37:31,666 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:37:31,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:37:31,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:31,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-22 14:37:31,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:37:31,741 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:37:31,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-07-22 14:37:31,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:31,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:37:31,797 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:37:31,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-22 14:37:31,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-22 14:37:31,856 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 14:37:31,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-07-22 14:37:31,866 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-22 14:37:31,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-22 14:37:31,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-22 14:37:32,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:32,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-07-22 14:37:32,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:37:32,080 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:37:32,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-22 14:37:32,154 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-22 14:37:32,155 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 2 case distinctions, treesize of input 21 treesize of output 30 [2022-07-22 14:37:32,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:37:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:37:32,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:37:32,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|) 1)) is different from false [2022-07-22 14:37:32,229 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|))) is different from false [2022-07-22 14:37:32,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base|) (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4) v_ArrVal_459)) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset|) 1)) is different from false [2022-07-22 14:37:32,240 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_459)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_461)) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)) (= 3 |c_ULTIMATE.start_main_#t~mem8#1|)) is different from false [2022-07-22 14:37:32,246 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_459)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_461)) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 3)) is different from false [2022-07-22 14:37:32,252 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0 v_ArrVal_459)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-22 14:37:32,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 v_ArrVal_459))) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-22 14:37:32,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_50| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) is different from false [2022-07-22 14:37:32,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_50| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) is different from false [2022-07-22 14:37:32,343 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:32,344 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 111 [2022-07-22 14:37:32,360 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:32,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 820 treesize of output 817 [2022-07-22 14:37:32,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 399 treesize of output 391 [2022-07-22 14:37:32,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 790 treesize of output 774 [2022-07-22 14:37:34,815 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse41 (not .cse10))) (let ((.cse5 (or .cse41 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse48 (let ((.cse50 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse50 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse50 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse49 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (.cse12 (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (let ((.cse47 (store (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3))) (or (= (select (select (store (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse47 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)) v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))))) (.cse22 (or .cse41 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse44 (let ((.cse45 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse45 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse45 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse43 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse42 (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse43 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)))) (or (= (select (select (store .cse42 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse42 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (let ((.cse11 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_arrayElimCell_42 Int)) (or (forall ((v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (or (= (select (select (store (let ((.cse23 (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse24 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse24 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse25 (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse26 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse26 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse25 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= 3 (select (select (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse27 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse27 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|))) (or .cse10 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse30 (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse31 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse31 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse29 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse28 (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse29 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)))) (or (= (select (select (store .cse28 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse28 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse5 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_arrayElimCell_42 Int) (v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int)) (let ((.cse32 (let ((.cse35 (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse36 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse36 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))))) (or (= (select (select (store .cse32 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse32 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse33 (let ((.cse34 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse34 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse34 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= 3 (select (select (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse37 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse37 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or .cse10 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse38 (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse40 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse40 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse39 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)) v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse12 .cse22))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (or (forall ((v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store (let ((.cse2 (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= 3 (select (select (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse5 (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse8 (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse9 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse9 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)))) (or (= (select (select (store .cse6 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse6 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse10) (or (= (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) .cse11) (or .cse11 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) .cse12 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int)) (let ((.cse13 (let ((.cse16 (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse17 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse17 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse16 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))))) (or (= (select (select (store .cse13 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse14 (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse15 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse15 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse14 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store .cse13 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= 3 (select (select (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse18 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse18 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or .cse10 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse19 (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse21 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse21 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse20 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse22))))) is different from false [2022-07-22 14:37:56,297 WARN L233 SmtUtils]: Spent 18.20s on a formula simplification. DAG size of input: 145 DAG size of output: 125 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 14:37:56,431 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-22 14:37:56,431 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 61 [2022-07-22 14:37:56,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:56,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 95 [2022-07-22 14:37:56,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-07-22 14:37:56,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-07-22 14:37:56,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:37:56,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:56,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:56,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 44 treesize of output 46 [2022-07-22 14:37:56,523 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-22 14:37:56,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 61 [2022-07-22 14:37:56,533 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 93 treesize of output 87 [2022-07-22 14:37:56,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-07-22 14:37:56,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2022-07-22 14:37:56,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-07-22 14:37:56,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:37:56,588 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-22 14:37:56,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 248 treesize of output 136 [2022-07-22 14:37:56,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:56,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 260 [2022-07-22 14:37:56,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 195 [2022-07-22 14:37:56,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 228 [2022-07-22 14:37:56,754 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-22 14:37:56,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 88 [2022-07-22 14:37:56,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:56,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:56,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 65 [2022-07-22 14:37:56,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-07-22 14:37:56,798 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-22 14:37:56,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 248 treesize of output 136 [2022-07-22 14:37:56,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:56,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:56,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 312 treesize of output 308 [2022-07-22 14:37:56,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 215 [2022-07-22 14:37:56,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 136 [2022-07-22 14:37:56,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:37:57,173 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:57,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2022-07-22 14:37:57,201 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:57,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2022-07-22 14:37:57,251 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-22 14:37:57,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 248 treesize of output 136 [2022-07-22 14:37:57,262 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:57,262 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 1 case distinctions, treesize of input 300 treesize of output 300 [2022-07-22 14:37:57,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 276 [2022-07-22 14:37:57,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-07-22 14:37:57,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:37:57,305 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:57,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 149 [2022-07-22 14:37:57,717 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-22 14:37:57,718 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 248 treesize of output 136 [2022-07-22 14:37:57,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:57,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:57,732 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 1 case distinctions, treesize of input 288 treesize of output 271 [2022-07-22 14:37:57,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 195 [2022-07-22 14:37:57,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 228 [2022-07-22 14:37:57,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:57,905 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:57,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 61 [2022-07-22 14:37:57,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:57,912 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:57,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2022-07-22 14:37:57,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 7 [2022-07-22 14:37:57,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2022-07-22 14:37:57,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 20 [2022-07-22 14:37:57,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:57,941 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:57,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 248 treesize of output 136 [2022-07-22 14:37:57,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:57,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:57,949 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:57,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 110 [2022-07-22 14:37:57,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 91 treesize of output 83 [2022-07-22 14:37:57,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:57,990 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:57,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 88 [2022-07-22 14:37:57,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:57,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:57,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:57,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 65 [2022-07-22 14:37:58,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 46 treesize of output 42 [2022-07-22 14:37:58,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:58,031 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:58,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 248 treesize of output 136 [2022-07-22 14:37:58,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:37:58,057 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:37:58,058 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 3 case distinctions, treesize of input 312 treesize of output 316 [2022-07-22 14:37:58,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 231 treesize of output 215 [2022-07-22 14:37:58,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 142 treesize of output 136 [2022-07-22 14:37:58,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2022-07-22 14:37:58,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 56 treesize of output 48 [2022-07-22 14:37:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-07-22 14:37:58,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832337689] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:37:58,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:37:58,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 45 [2022-07-22 14:37:58,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213340155] [2022-07-22 14:37:58,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:37:58,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-22 14:37:58,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:37:58,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-22 14:37:58,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1074, Unknown=12, NotChecked=750, Total=1980 [2022-07-22 14:37:58,739 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 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 14:38:00,150 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (not .cse11))) (let ((.cse6 (or .cse0 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse49 (let ((.cse51 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse51 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse51 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store .cse49 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse50 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (.cse14 (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse47 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (let ((.cse48 (store (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3))) (or (= (select (select (store (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse48 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)) v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))))) (.cse24 (or .cse0 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse45 (let ((.cse46 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse46 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse46 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse43 (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse44 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)))) (or (= (select (select (store .cse43 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse43 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (let ((.cse12 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_arrayElimCell_42 Int)) (or (forall ((v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (or (= (select (select (store (let ((.cse25 (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse26 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse26 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse25 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse27 (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse28 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse28 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= 3 (select (select (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse29 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse29 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|))) (or .cse11 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse32 (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse33 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse33 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse30 (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse31 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)))) (or (= (select (select (store .cse30 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse30 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse6 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_arrayElimCell_42 Int) (v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int)) (let ((.cse34 (let ((.cse37 (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse38 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse38 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse37 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))))) (or (= (select (select (store .cse34 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse34 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse35 (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse36 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse36 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= 3 (select (select (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse39 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse39 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or .cse11 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse40 (let ((.cse42 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse42 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse42 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse40 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse41 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)) v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse14 .cse24)) (.cse13 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) .cse0 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (or (forall ((v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse2 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse2 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store (let ((.cse3 (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= 3 (select (select (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse5 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse5 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse6 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse9 (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse10 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse10 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)))) (or (= (select (select (store .cse7 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse7 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse11) (or (= (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) .cse12) (or .cse12 .cse13) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) .cse14 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int)) (let ((.cse15 (let ((.cse18 (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse19 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse19 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse18 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))))) (or (= (select (select (store .cse15 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse16 (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse17 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse17 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse16 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store .cse15 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= 3 (select (select (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse20 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse20 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or .cse11 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse21 (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse23 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse23 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse21 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse22 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) .cse24 .cse13))))) is different from false [2022-07-22 14:38:01,467 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (not .cse11))) (let ((.cse6 (or .cse0 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse49 (let ((.cse51 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse51 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse51 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store .cse49 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse50 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (.cse14 (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse47 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (let ((.cse48 (store (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3))) (or (= (select (select (store (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse48 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)) v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))))) (.cse24 (or .cse0 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse45 (let ((.cse46 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse46 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse46 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse43 (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse44 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)))) (or (= (select (select (store .cse43 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse43 v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (let ((.cse12 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_arrayElimCell_42 Int)) (or (forall ((v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (or (= (select (select (store (let ((.cse25 (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse26 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse26 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse25 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse27 (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse28 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse28 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= 3 (select (select (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse29 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse29 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|))) (or .cse11 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse32 (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse33 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse33 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse30 (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse31 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)))) (or (= (select (select (store .cse30 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse30 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) .cse6 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_arrayElimCell_42 Int) (v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int)) (let ((.cse34 (let ((.cse37 (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse38 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse38 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse37 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))))) (or (= (select (select (store .cse34 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse34 v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse35 (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse36 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse36 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= 3 (select (select (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse39 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse39 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or .cse11 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_42 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse40 (let ((.cse42 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse42 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse42 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse40 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse41 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)) v_arrayElimCell_42 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse14 .cse24)) (.cse13 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (and .cse0 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (or (forall ((v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse2 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse2 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store (let ((.cse3 (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= 3 (select (select (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse5 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse5 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) .cse6 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse9 (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse10 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse10 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)))) (or (= (select (select (store .cse7 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse7 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= 3 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) .cse11) (or (= (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) .cse12) (or .cse12 .cse13) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) .cse14 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_448 Int) (v_ArrVal_455 (Array Int Int))) (or (forall ((v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int) (v_arrayElimCell_45 Int)) (let ((.cse15 (let ((.cse18 (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse19 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse19 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse18 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))))) (or (= (select (select (store .cse15 v_arrayElimCell_45 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_arrayElimCell_44 Int)) (= (select (select (store (let ((.cse16 (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse17 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse17 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (store .cse16 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459))) v_arrayElimCell_44 v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store .cse15 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= 3 (select (select (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse20 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse20 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (or .cse11 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_448 Int) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse21 (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_448)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_455))) (store .cse23 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse23 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select (select (store (store .cse21 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse22 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_459)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |v_ULTIMATE.start_main_~p~0#1.base_50| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) .cse24 .cse13))))) is different from false [2022-07-22 14:38:01,605 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (and (forall ((v_ArrVal_457 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_50| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (not (= .cse4 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse4 |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-22 14:38:01,630 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (and (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_457 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_ArrVal_459 Int) (v_ArrVal_455 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_50|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 .cse3 v_ArrVal_459)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_454) |v_ULTIMATE.start_main_~p~0#1.base_50| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-22 14:38:03,634 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_459 Int)) (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 v_ArrVal_459))) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_457) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_461)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) is different from false [2022-07-22 14:38:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:38:04,475 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-07-22 14:38:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 14:38:04,475 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 14:38:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:38:04,476 INFO L225 Difference]: With dead ends: 77 [2022-07-22 14:38:04,476 INFO L226 Difference]: Without dead ends: 75 [2022-07-22 14:38:04,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 15 IntricatePredicates, 5 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=216, Invalid=1719, Unknown=17, NotChecked=1470, Total=3422 [2022-07-22 14:38:04,478 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 329 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:38:04,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 145 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 161 Invalid, 0 Unknown, 329 Unchecked, 0.1s Time] [2022-07-22 14:38:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-22 14:38:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2022-07-22 14:38:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 66 states have internal predecessors, (77), 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 14:38:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2022-07-22 14:38:04,490 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 32 [2022-07-22 14:38:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:38:04,490 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2022-07-22 14:38:04,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 45 states have internal predecessors, (85), 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 14:38:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-07-22 14:38:04,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 14:38:04,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:38:04,494 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:38:04,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 14:38:04,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-22 14:38:04,710 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:38:04,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:38:04,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2060333054, now seen corresponding path program 1 times [2022-07-22 14:38:04,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:38:04,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304205807] [2022-07-22 14:38:04,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:38:04,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:38:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:38:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 14:38:04,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:38:04,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304205807] [2022-07-22 14:38:04,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304205807] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:38:04,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942648175] [2022-07-22 14:38:04,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:38:04,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:38:04,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:38:04,768 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:38:04,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 14:38:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:38:04,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 14:38:04,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:38:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 14:38:04,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:38:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 14:38:04,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942648175] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:38:04,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:38:04,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2022-07-22 14:38:04,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711922691] [2022-07-22 14:38:04,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:38:04,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 14:38:04,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:38:04,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 14:38:04,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 14:38:04,933 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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 14:38:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:38:05,007 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2022-07-22 14:38:05,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 14:38:05,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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) Word has length 34 [2022-07-22 14:38:05,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:38:05,008 INFO L225 Difference]: With dead ends: 90 [2022-07-22 14:38:05,008 INFO L226 Difference]: Without dead ends: 85 [2022-07-22 14:38:05,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-22 14:38:05,009 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 73 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:38:05,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 64 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:38:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-22 14:38:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2022-07-22 14:38:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 71 states have internal predecessors, (82), 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 14:38:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-07-22 14:38:05,012 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 34 [2022-07-22 14:38:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:38:05,012 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-07-22 14:38:05,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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 14:38:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-07-22 14:38:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 14:38:05,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:38:05,013 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:38:05,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-22 14:38:05,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:38:05,223 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:38:05,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:38:05,224 INFO L85 PathProgramCache]: Analyzing trace with hash 2062043076, now seen corresponding path program 1 times [2022-07-22 14:38:05,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:38:05,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682634520] [2022-07-22 14:38:05,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:38:05,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:38:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:38:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:38:05,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:38:05,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682634520] [2022-07-22 14:38:05,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682634520] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:38:05,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880796518] [2022-07-22 14:38:05,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:38:05,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:38:05,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:38:05,524 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:38:05,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 14:38:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:38:05,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-22 14:38:05,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:38:05,737 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 13 treesize of output 9 [2022-07-22 14:38:05,748 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-22 14:38:05,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-07-22 14:38:05,798 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-07-22 14:38:05,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 14:38:05,809 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-07-22 14:38:05,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-22 14:38:05,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 14:38:05,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 14:38:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 14:38:05,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:38:07,080 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~t~0#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base|) (+ |ULTIMATE.start_main_~t~0#1.offset| 4) |c_ULTIMATE.start_main_~l2~0#1.offset|)) |c_ULTIMATE.start_main_~l1~0#1.base|) (+ |c_ULTIMATE.start_main_~l1~0#1.offset| 4)) 0)) (forall ((|ULTIMATE.start_main_~t~0#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base|) (+ |ULTIMATE.start_main_~t~0#1.offset| 4) |c_ULTIMATE.start_main_~l2~0#1.base|)) |c_ULTIMATE.start_main_~l1~0#1.base|) (+ |c_ULTIMATE.start_main_~l1~0#1.offset| 4)) 0))) is different from false [2022-07-22 14:38:23,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-22 14:38:23,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-07-22 14:38:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 5 refuted. 2 times theorem prover too weak. 10 trivial. 1 not checked. [2022-07-22 14:38:23,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880796518] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:38:23,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:38:23,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 9] total 26 [2022-07-22 14:38:23,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926317741] [2022-07-22 14:38:23,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:38:23,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-22 14:38:23,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:38:23,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-22 14:38:23,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=521, Unknown=11, NotChecked=46, Total=650 [2022-07-22 14:38:23,224 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:38:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:38:28,772 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2022-07-22 14:38:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 14:38:28,772 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-22 14:38:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:38:28,772 INFO L225 Difference]: With dead ends: 88 [2022-07-22 14:38:28,772 INFO L226 Difference]: Without dead ends: 81 [2022-07-22 14:38:28,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=133, Invalid=981, Unknown=12, NotChecked=64, Total=1190 [2022-07-22 14:38:28,773 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 14:38:28,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 212 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 291 Invalid, 0 Unknown, 137 Unchecked, 0.2s Time] [2022-07-22 14:38:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-22 14:38:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-07-22 14:38:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 73 states have internal predecessors, (85), 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 14:38:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-07-22 14:38:28,776 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 34 [2022-07-22 14:38:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:38:28,776 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-07-22 14:38:28,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:38:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-07-22 14:38:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-22 14:38:28,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:38:28,777 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:38:28,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 14:38:28,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:38:28,991 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:38:28,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:38:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash 355505244, now seen corresponding path program 2 times [2022-07-22 14:38:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:38:28,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661969741] [2022-07-22 14:38:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:38:28,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:38:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:38:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:38:29,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:38:29,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661969741] [2022-07-22 14:38:29,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661969741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:38:29,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507400489] [2022-07-22 14:38:29,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:38:29,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:38:29,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:38:29,389 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:38:29,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 14:38:29,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:38:29,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:38:29,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-22 14:38:29,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:38:29,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:38:29,585 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 14:38:29,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 14:38:29,631 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 13 treesize of output 9 [2022-07-22 14:38:29,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 14:38:29,696 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:38:29,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-07-22 14:38:29,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:38:29,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-22 14:38:29,726 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-22 14:38:29,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-07-22 14:38:29,780 INFO L356 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2022-07-22 14:38:29,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 85 [2022-07-22 14:38:29,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 96 [2022-07-22 14:38:29,861 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-22 14:38:29,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 158 [2022-07-22 14:38:29,877 INFO L356 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-07-22 14:38:29,877 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 149 [2022-07-22 14:38:29,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2022-07-22 14:38:30,043 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 14:38:30,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 83 [2022-07-22 14:38:30,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 62 [2022-07-22 14:38:30,053 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 68 treesize of output 58 [2022-07-22 14:38:30,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-07-22 14:38:30,069 INFO L356 Elim1Store]: treesize reduction 36, result has 37.9 percent of original size [2022-07-22 14:38:30,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2022-07-22 14:38:30,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-07-22 14:38:30,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 14:38:30,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:38:30,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:38:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:38:30,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:38:30,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_789 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-07-22 14:38:30,173 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_789 (Array Int Int))) (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_789) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2022-07-22 14:38:30,179 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_788) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_789) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_786) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_787) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2022-07-22 14:38:30,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_787 (Array Int Int)) (v_ArrVal_789 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (= 3 (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_788) .cse0 v_ArrVal_789) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_786) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_787) .cse0) .cse1)))))) is different from false [2022-07-22 14:38:30,255 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-22 14:38:30,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 119 [2022-07-22 14:38:30,285 INFO L356 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2022-07-22 14:38:30,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 903 treesize of output 909 [2022-07-22 14:38:30,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 316 [2022-07-22 14:38:30,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 696 treesize of output 568 [2022-07-22 14:38:33,604 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:33,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2022-07-22 14:38:33,609 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:33,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2022-07-22 14:38:33,623 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:33,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2022-07-22 14:38:33,628 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:33,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2022-07-22 14:38:33,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:33,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 116 [2022-07-22 14:38:33,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:33,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 134 [2022-07-22 14:38:33,666 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:33,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2022-07-22 14:38:33,671 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:33,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2022-07-22 14:38:33,684 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:33,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 109 [2022-07-22 14:38:33,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:33,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 118 [2022-07-22 14:38:33,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:33,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2022-07-22 14:38:33,729 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:33,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2022-07-22 14:38:34,454 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:34,455 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 79 [2022-07-22 14:38:34,460 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:34,460 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 69 [2022-07-22 14:38:34,468 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:34,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 689 treesize of output 494 [2022-07-22 14:38:34,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:38:34,773 INFO L356 Elim1Store]: treesize reduction 222, result has 58.7 percent of original size [2022-07-22 14:38:34,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 5120 treesize of output 4489 [2022-07-22 14:38:34,861 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:34,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2205 treesize of output 1581 [2022-07-22 14:38:34,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:34,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 887 treesize of output 803 [2022-07-22 14:38:34,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:34,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1334 treesize of output 1282 [2022-07-22 14:38:34,990 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:34,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1270 treesize of output 1250 [2022-07-22 14:38:35,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 77 [2022-07-22 14:38:40,152 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:40,153 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 156 [2022-07-22 14:38:40,158 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:40,158 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 136 [2022-07-22 14:38:40,168 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:40,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 711 treesize of output 528 [2022-07-22 14:38:40,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:38:40,494 INFO L356 Elim1Store]: treesize reduction 222, result has 58.7 percent of original size [2022-07-22 14:38:40,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 5350 treesize of output 4575 [2022-07-22 14:38:40,636 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:40,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 4411 treesize of output 3571 [2022-07-22 14:38:40,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3488 treesize of output 3296 [2022-07-22 14:38:40,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:40,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2699 treesize of output 2587 [2022-07-22 14:38:40,846 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:40,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3088 treesize of output 2932 [2022-07-22 14:38:40,916 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:40,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2896 treesize of output 2836 [2022-07-22 14:38:58,569 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:58,569 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 75 [2022-07-22 14:38:58,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:58,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 23024 treesize of output 18217 [2022-07-22 14:38:58,720 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:58,720 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18150 treesize of output 13140 [2022-07-22 14:38:58,763 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:58,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42826 treesize of output 39823 [2022-07-22 14:38:58,969 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:58,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39814 treesize of output 28990 [2022-07-22 14:38:59,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28972 treesize of output 24956 [2022-07-22 14:38:59,236 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:59,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 24774 treesize of output 24480 [2022-07-22 14:38:59,496 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:59,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 24326 treesize of output 23778 [2022-07-22 14:38:59,769 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:38:59,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23414 treesize of output 23182