./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/calendar.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3dbbec33 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/heap-data/calendar.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 fe08ef78ee5c945bc38e9e915e26405aefe9ffb2d4911c91347e07e6a879dcd5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 11:15:30,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 11:15:30,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 11:15:30,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 11:15:30,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 11:15:30,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 11:15:30,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 11:15:30,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 11:15:30,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 11:15:30,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 11:15:30,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 11:15:30,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 11:15:30,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 11:15:30,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 11:15:30,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 11:15:30,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 11:15:30,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 11:15:30,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 11:15:30,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 11:15:30,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 11:15:30,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 11:15:30,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 11:15:30,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 11:15:30,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 11:15:30,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 11:15:30,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 11:15:30,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 11:15:30,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 11:15:30,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 11:15:30,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 11:15:30,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 11:15:30,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 11:15:30,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 11:15:30,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 11:15:30,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 11:15:30,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 11:15:30,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 11:15:30,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 11:15:30,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 11:15:30,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 11:15:30,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 11:15:30,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 11:15:30,548 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 11:15:30,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 11:15:30,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 11:15:30,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 11:15:30,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 11:15:30,550 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 11:15:30,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 11:15:30,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 11:15:30,551 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 11:15:30,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 11:15:30,552 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 11:15:30,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 11:15:30,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 11:15:30,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 11:15:30,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 11:15:30,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 11:15:30,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 11:15:30,554 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 11:15:30,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 11:15:30,554 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 11:15:30,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 11:15:30,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 11:15:30,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 11:15:30,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 11:15:30,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 11:15:30,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 11:15:30,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 11:15:30,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 11:15:30,556 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 11:15:30,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 11:15:30,557 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 11:15:30,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 11:15:30,557 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 11:15:30,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 11:15:30,557 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 11:15:30,558 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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 -> fe08ef78ee5c945bc38e9e915e26405aefe9ffb2d4911c91347e07e6a879dcd5 [2023-02-14 11:15:30,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 11:15:30,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 11:15:30,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 11:15:30,834 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 11:15:30,835 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 11:15:30,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/calendar.i [2023-02-14 11:15:31,930 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 11:15:32,119 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 11:15:32,120 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/calendar.i [2023-02-14 11:15:32,138 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11c490890/cd2b6b45ae924eb380ea58623e5490f3/FLAGb7c2c57f4 [2023-02-14 11:15:32,147 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11c490890/cd2b6b45ae924eb380ea58623e5490f3 [2023-02-14 11:15:32,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 11:15:32,150 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 11:15:32,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 11:15:32,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 11:15:32,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 11:15:32,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 11:15:32" (1/1) ... [2023-02-14 11:15:32,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@542abe05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:15:32, skipping insertion in model container [2023-02-14 11:15:32,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 11:15:32" (1/1) ... [2023-02-14 11:15:32,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 11:15:32,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 11:15:32,429 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/calendar.i[23742,23755] [2023-02-14 11:15:32,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 11:15:32,445 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 11:15:32,493 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/calendar.i[23742,23755] [2023-02-14 11:15:32,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 11:15:32,515 INFO L208 MainTranslator]: Completed translation [2023-02-14 11:15:32,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:15:32 WrapperNode [2023-02-14 11:15:32,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 11:15:32,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 11:15:32,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 11:15:32,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 11:15:32,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:15:32" (1/1) ... [2023-02-14 11:15:32,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:15:32" (1/1) ... [2023-02-14 11:15:32,551 INFO L138 Inliner]: procedures = 121, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 71 [2023-02-14 11:15:32,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 11:15:32,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 11:15:32,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 11:15:32,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 11:15:32,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:15:32" (1/1) ... [2023-02-14 11:15:32,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:15:32" (1/1) ... [2023-02-14 11:15:32,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:15:32" (1/1) ... [2023-02-14 11:15:32,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:15:32" (1/1) ... [2023-02-14 11:15:32,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:15:32" (1/1) ... [2023-02-14 11:15:32,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:15:32" (1/1) ... [2023-02-14 11:15:32,589 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:15:32" (1/1) ... [2023-02-14 11:15:32,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:15:32" (1/1) ... [2023-02-14 11:15:32,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 11:15:32,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 11:15:32,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 11:15:32,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 11:15:32,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:15:32" (1/1) ... [2023-02-14 11:15:32,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 11:15:32,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:15:32,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 11:15:32,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 11:15:32,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 11:15:32,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 11:15:32,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 11:15:32,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 11:15:32,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 11:15:32,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 11:15:32,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 11:15:32,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 11:15:32,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 11:15:32,744 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 11:15:32,745 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 11:15:32,946 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 11:15:32,964 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 11:15:32,964 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 11:15:32,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 11:15:32 BoogieIcfgContainer [2023-02-14 11:15:32,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 11:15:32,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 11:15:32,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 11:15:32,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 11:15:32,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 11:15:32" (1/3) ... [2023-02-14 11:15:32,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95584ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 11:15:32, skipping insertion in model container [2023-02-14 11:15:32,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:15:32" (2/3) ... [2023-02-14 11:15:32,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95584ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 11:15:32, skipping insertion in model container [2023-02-14 11:15:32,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 11:15:32" (3/3) ... [2023-02-14 11:15:32,973 INFO L112 eAbstractionObserver]: Analyzing ICFG calendar.i [2023-02-14 11:15:32,991 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 11:15:32,992 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 11:15:33,034 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 11:15:33,038 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b802443, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 11:15:33,039 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 11:15:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:15:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 11:15:33,046 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:15:33,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:15:33,047 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:15:33,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:15:33,050 INFO L85 PathProgramCache]: Analyzing trace with hash 399551724, now seen corresponding path program 1 times [2023-02-14 11:15:33,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:15:33,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185230508] [2023-02-14 11:15:33,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:15:33,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:15:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:15:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:33,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:15:33,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185230508] [2023-02-14 11:15:33,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185230508] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:15:33,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:15:33,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 11:15:33,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606443480] [2023-02-14 11:15:33,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:15:33,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 11:15:33,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:15:33,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 11:15:33,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 11:15:33,196 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2023-02-14 11:15:33,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:15:33,210 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2023-02-14 11:15:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 11:15:33,212 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2023-02-14 11:15:33,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:15:33,218 INFO L225 Difference]: With dead ends: 35 [2023-02-14 11:15:33,218 INFO L226 Difference]: Without dead ends: 18 [2023-02-14 11:15:33,221 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 [2023-02-14 11:15:33,223 INFO L413 NwaCegarLoop]: 27 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, 27 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 [2023-02-14 11:15:33,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 11:15:33,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-14 11:15:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-14 11:15:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 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) [2023-02-14 11:15:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2023-02-14 11:15:33,253 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 10 [2023-02-14 11:15:33,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:15:33,254 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2023-02-14 11:15:33,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2023-02-14 11:15:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2023-02-14 11:15:33,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 11:15:33,255 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:15:33,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:15:33,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 11:15:33,256 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:15:33,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:15:33,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1946762309, now seen corresponding path program 1 times [2023-02-14 11:15:33,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:15:33,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314053852] [2023-02-14 11:15:33,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:15:33,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:15:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:15:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:33,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:15:33,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314053852] [2023-02-14 11:15:33,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314053852] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:15:33,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:15:33,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 11:15:33,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799739368] [2023-02-14 11:15:33,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:15:33,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 11:15:33,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:15:33,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 11:15:33,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 11:15:33,404 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2023-02-14 11:15:33,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:15:33,466 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-02-14 11:15:33,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 11:15:33,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 [2023-02-14 11:15:33,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:15:33,467 INFO L225 Difference]: With dead ends: 35 [2023-02-14 11:15:33,467 INFO L226 Difference]: Without dead ends: 23 [2023-02-14 11:15:33,468 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 [2023-02-14 11:15:33,469 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 11:15:33,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 11:15:33,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-14 11:15:33,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-14 11:15:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:15:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2023-02-14 11:15:33,475 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2023-02-14 11:15:33,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:15:33,476 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2023-02-14 11:15:33,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2023-02-14 11:15:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2023-02-14 11:15:33,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 11:15:33,477 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:15:33,477 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:15:33,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 11:15:33,478 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:15:33,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:15:33,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1070818203, now seen corresponding path program 1 times [2023-02-14 11:15:33,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:15:33,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38874958] [2023-02-14 11:15:33,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:15:33,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:15:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:15:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:34,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:15:34,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38874958] [2023-02-14 11:15:34,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38874958] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:15:34,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:15:34,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-14 11:15:34,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651746939] [2023-02-14 11:15:34,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:15:34,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 11:15:34,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:15:34,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 11:15:34,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-14 11:15:34,161 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 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) [2023-02-14 11:15:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:15:34,615 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2023-02-14 11:15:34,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 11:15:34,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 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 [2023-02-14 11:15:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:15:34,620 INFO L225 Difference]: With dead ends: 78 [2023-02-14 11:15:34,620 INFO L226 Difference]: Without dead ends: 68 [2023-02-14 11:15:34,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2023-02-14 11:15:34,627 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 140 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 11:15:34,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 114 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 11:15:34,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-02-14 11:15:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 27. [2023-02-14 11:15:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 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) [2023-02-14 11:15:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-02-14 11:15:34,642 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2023-02-14 11:15:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:15:34,642 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-02-14 11:15:34,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 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) [2023-02-14 11:15:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-02-14 11:15:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 11:15:34,643 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:15:34,643 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:15:34,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 11:15:34,644 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:15:34,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:15:34,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1737463723, now seen corresponding path program 1 times [2023-02-14 11:15:34,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:15:34,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070067073] [2023-02-14 11:15:34,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:15:34,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:15:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:15:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 11:15:34,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:15:34,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070067073] [2023-02-14 11:15:34,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070067073] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:15:34,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:15:34,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 11:15:34,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649514695] [2023-02-14 11:15:34,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:15:34,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 11:15:34,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:15:34,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 11:15:34,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-14 11:15:34,737 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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) [2023-02-14 11:15:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:15:34,789 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2023-02-14 11:15:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 11:15:34,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 19 [2023-02-14 11:15:34,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:15:34,790 INFO L225 Difference]: With dead ends: 50 [2023-02-14 11:15:34,790 INFO L226 Difference]: Without dead ends: 38 [2023-02-14 11:15:34,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-14 11:15:34,792 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 11:15:34,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 11:15:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-14 11:15:34,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2023-02-14 11:15:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:15:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2023-02-14 11:15:34,797 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 19 [2023-02-14 11:15:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:15:34,797 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2023-02-14 11:15:34,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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) [2023-02-14 11:15:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2023-02-14 11:15:34,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 11:15:34,798 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:15:34,798 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:15:34,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 11:15:34,799 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:15:34,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:15:34,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1737523305, now seen corresponding path program 1 times [2023-02-14 11:15:34,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:15:34,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36980514] [2023-02-14 11:15:34,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:15:34,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:15:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:15:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 11:15:34,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:15:34,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36980514] [2023-02-14 11:15:34,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36980514] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:15:34,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:15:34,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 11:15:34,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72289688] [2023-02-14 11:15:34,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:15:34,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 11:15:34,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:15:34,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 11:15:34,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 11:15:34,841 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:15:34,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:15:34,859 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2023-02-14 11:15:34,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 11:15:34,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-14 11:15:34,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:15:34,861 INFO L225 Difference]: With dead ends: 34 [2023-02-14 11:15:34,861 INFO L226 Difference]: Without dead ends: 32 [2023-02-14 11:15:34,861 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 [2023-02-14 11:15:34,864 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 11:15:34,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 54 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 11:15:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-14 11:15:34,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-14 11:15:34,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:15:34,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-02-14 11:15:34,879 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 19 [2023-02-14 11:15:34,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:15:34,880 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-02-14 11:15:34,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:15:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-02-14 11:15:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 11:15:34,885 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:15:34,885 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:15:34,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 11:15:34,886 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:15:34,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:15:34,886 INFO L85 PathProgramCache]: Analyzing trace with hash -782496211, now seen corresponding path program 1 times [2023-02-14 11:15:34,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:15:34,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307547696] [2023-02-14 11:15:34,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:15:34,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:15:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:15:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:35,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:15:35,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307547696] [2023-02-14 11:15:35,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307547696] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:15:35,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:15:35,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-14 11:15:35,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46690288] [2023-02-14 11:15:35,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:15:35,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 11:15:35,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:15:35,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 11:15:35,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-14 11:15:35,157 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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) [2023-02-14 11:15:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:15:35,417 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2023-02-14 11:15:35,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 11:15:35,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 19 [2023-02-14 11:15:35,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:15:35,418 INFO L225 Difference]: With dead ends: 76 [2023-02-14 11:15:35,418 INFO L226 Difference]: Without dead ends: 74 [2023-02-14 11:15:35,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2023-02-14 11:15:35,419 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 109 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 11:15:35,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 108 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 11:15:35,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-14 11:15:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 35. [2023-02-14 11:15:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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) [2023-02-14 11:15:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2023-02-14 11:15:35,424 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 19 [2023-02-14 11:15:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:15:35,425 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2023-02-14 11:15:35,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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) [2023-02-14 11:15:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2023-02-14 11:15:35,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 11:15:35,426 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:15:35,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:15:35,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 11:15:35,427 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:15:35,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:15:35,427 INFO L85 PathProgramCache]: Analyzing trace with hash 830966801, now seen corresponding path program 1 times [2023-02-14 11:15:35,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:15:35,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785461032] [2023-02-14 11:15:35,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:15:35,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:15:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:15:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:35,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:15:35,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785461032] [2023-02-14 11:15:35,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785461032] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:15:35,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490006545] [2023-02-14 11:15:35,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:15:35,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:15:35,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:15:35,562 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 11:15:35,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 11:15:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:15:35,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-14 11:15:35,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:15:35,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:15:35,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:15:35,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 11:15:35,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 11:15:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:35,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 11:15:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:35,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490006545] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 11:15:35,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 11:15:35,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-02-14 11:15:35,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424400697] [2023-02-14 11:15:35,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 11:15:35,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 11:15:35,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:15:35,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 11:15:35,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 11:15:35,893 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:15:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:15:35,981 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2023-02-14 11:15:35,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 11:15:35,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-14 11:15:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:15:35,984 INFO L225 Difference]: With dead ends: 68 [2023-02-14 11:15:35,984 INFO L226 Difference]: Without dead ends: 40 [2023-02-14 11:15:35,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-14 11:15:35,985 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 11:15:35,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 125 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 11:15:35,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-14 11:15:35,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-02-14 11:15:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:15:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2023-02-14 11:15:35,991 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 25 [2023-02-14 11:15:35,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:15:35,991 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2023-02-14 11:15:35,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:15:35,991 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2023-02-14 11:15:35,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-14 11:15:35,992 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:15:35,992 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] [2023-02-14 11:15:35,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-14 11:15:36,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:15:36,198 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:15:36,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:15:36,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1524144039, now seen corresponding path program 2 times [2023-02-14 11:15:36,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:15:36,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917052755] [2023-02-14 11:15:36,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:15:36,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:15:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:15:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:36,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:15:36,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917052755] [2023-02-14 11:15:36,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917052755] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:15:36,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198697055] [2023-02-14 11:15:36,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 11:15:36,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:15:36,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:15:36,834 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 11:15:36,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 11:15:36,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 11:15:36,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 11:15:36,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-14 11:15:36,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:15:36,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 11:15:36,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:36,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:36,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 11:15:37,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:15:37,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:15:37,084 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 11:15:37,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-14 11:15:37,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-02-14 11:15:37,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 11:15:37,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2023-02-14 11:15:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:37,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 11:15:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:37,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198697055] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 11:15:37,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 11:15:37,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 23 [2023-02-14 11:15:37,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875513992] [2023-02-14 11:15:37,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 11:15:37,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-14 11:15:37,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:15:37,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-14 11:15:37,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2023-02-14 11:15:37,624 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:15:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:15:40,425 INFO L93 Difference]: Finished difference Result 136 states and 165 transitions. [2023-02-14 11:15:40,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-14 11:15:40,426 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-14 11:15:40,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:15:40,427 INFO L225 Difference]: With dead ends: 136 [2023-02-14 11:15:40,427 INFO L226 Difference]: Without dead ends: 121 [2023-02-14 11:15:40,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=883, Invalid=2309, Unknown=0, NotChecked=0, Total=3192 [2023-02-14 11:15:40,429 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 606 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 11:15:40,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 297 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 11:15:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-14 11:15:40,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 48. [2023-02-14 11:15:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 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) [2023-02-14 11:15:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2023-02-14 11:15:40,435 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 30 [2023-02-14 11:15:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:15:40,436 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2023-02-14 11:15:40,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:15:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2023-02-14 11:15:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 11:15:40,437 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:15:40,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:15:40,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 11:15:40,645 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,SelfDestructingSolverStorable7 [2023-02-14 11:15:40,645 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:15:40,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:15:40,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1895186671, now seen corresponding path program 1 times [2023-02-14 11:15:40,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:15:40,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524562563] [2023-02-14 11:15:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:15:40,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:15:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:15:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:41,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:15:41,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524562563] [2023-02-14 11:15:41,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524562563] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:15:41,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137526393] [2023-02-14 11:15:41,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:15:41,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:15:41,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:15:41,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 11:15:41,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-14 11:15:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:15:41,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-14 11:15:41,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:15:41,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:41,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:41,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 11:15:41,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 11:15:41,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:15:41,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:15:41,336 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 11:15:41,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-14 11:15:41,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-02-14 11:15:41,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2023-02-14 11:15:41,515 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-14 11:15:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:41,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 11:15:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:41,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137526393] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 11:15:41,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 11:15:41,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 18 [2023-02-14 11:15:41,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179950658] [2023-02-14 11:15:41,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 11:15:41,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 11:15:41,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:15:41,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 11:15:41,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=255, Unknown=1, NotChecked=0, Total=306 [2023-02-14 11:15:41,758 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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) [2023-02-14 11:15:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:15:42,668 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2023-02-14 11:15:42,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 11:15:42,668 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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 [2023-02-14 11:15:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:15:42,669 INFO L225 Difference]: With dead ends: 67 [2023-02-14 11:15:42,669 INFO L226 Difference]: Without dead ends: 65 [2023-02-14 11:15:42,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=363, Invalid=896, Unknown=1, NotChecked=0, Total=1260 [2023-02-14 11:15:42,671 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 221 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 11:15:42,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 221 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 11:15:42,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-14 11:15:42,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2023-02-14 11:15:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:15:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2023-02-14 11:15:42,694 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 32 [2023-02-14 11:15:42,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:15:42,694 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2023-02-14 11:15:42,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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) [2023-02-14 11:15:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2023-02-14 11:15:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 11:15:42,698 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:15:42,698 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:15:42,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 11:15:42,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:15:42,905 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:15:42,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:15:42,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1135420755, now seen corresponding path program 3 times [2023-02-14 11:15:42,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:15:42,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421567586] [2023-02-14 11:15:42,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:15:42,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:15:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:15:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:43,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:15:43,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421567586] [2023-02-14 11:15:43,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421567586] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:15:43,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370114323] [2023-02-14 11:15:43,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 11:15:43,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:15:43,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:15:43,385 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 11:15:43,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-14 11:15:43,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-14 11:15:43,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 11:15:43,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-14 11:15:43,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:15:43,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 11:15:43,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:15:43,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:15:43,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:15:43,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:15:43,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:43,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 11:15:43,577 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 11:15:43,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-14 11:15:43,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 11:15:43,812 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-14 11:15:43,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2023-02-14 11:15:43,821 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 11:15:43,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-14 11:15:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:43,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 11:15:43,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:15:43,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-02-14 11:15:43,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:15:43,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2023-02-14 11:15:43,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-14 11:15:43,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-14 11:15:44,091 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:15:44,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-02-14 11:15:44,096 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:15:44,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-14 11:15:44,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:15:44,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2023-02-14 11:15:44,108 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:15:44,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-02-14 11:15:44,121 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:44,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370114323] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 11:15:44,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 11:15:44,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 16 [2023-02-14 11:15:44,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588224653] [2023-02-14 11:15:44,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 11:15:44,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-14 11:15:44,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:15:44,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-14 11:15:44,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-02-14 11:15:44,124 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:15:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:15:44,431 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2023-02-14 11:15:44,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 11:15:44,431 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-14 11:15:44,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:15:44,432 INFO L225 Difference]: With dead ends: 102 [2023-02-14 11:15:44,432 INFO L226 Difference]: Without dead ends: 61 [2023-02-14 11:15:44,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2023-02-14 11:15:44,433 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 69 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 11:15:44,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 321 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 11:15:44,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-02-14 11:15:44,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2023-02-14 11:15:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 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) [2023-02-14 11:15:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2023-02-14 11:15:44,438 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 38 [2023-02-14 11:15:44,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:15:44,439 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2023-02-14 11:15:44,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:15:44,439 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2023-02-14 11:15:44,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 11:15:44,440 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:15:44,440 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:15:44,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-14 11:15:44,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:15:44,647 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:15:44,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:15:44,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1704598909, now seen corresponding path program 4 times [2023-02-14 11:15:44,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:15:44,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699451549] [2023-02-14 11:15:44,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:15:44,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:15:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:15:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:45,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:15:45,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699451549] [2023-02-14 11:15:45,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699451549] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:15:45,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739425611] [2023-02-14 11:15:45,522 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 11:15:45,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:15:45,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:15:45,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 11:15:45,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 11:15:45,639 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 11:15:45,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 11:15:45,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 80 conjunts are in the unsatisfiable core [2023-02-14 11:15:45,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:15:45,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:45,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:45,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 11:15:45,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 11:15:45,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:15:45,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:15:45,738 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 11:15:45,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2023-02-14 11:15:45,760 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 11:15:45,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-14 11:15:45,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:15:45,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:15:45,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:45,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 11:15:45,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:45,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2023-02-14 11:15:45,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:45,889 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-02-14 11:15:45,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 28 treesize of output 22 [2023-02-14 11:15:45,894 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 32 [2023-02-14 11:15:46,443 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2023-02-14 11:15:46,444 INFO L350 Elim1Store]: Elim1 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 163 treesize of output 149 [2023-02-14 11:15:46,504 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2023-02-14 11:15:46,504 INFO L350 Elim1Store]: Elim1 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 119 [2023-02-14 11:15:47,429 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2023-02-14 11:15:47,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2023-02-14 11:15:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:47,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 11:15:47,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:15:47,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2023-02-14 11:15:47,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:15:47,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2023-02-14 11:15:47,838 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:15:47,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 107 [2023-02-14 11:15:47,843 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:15:47,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 83 [2023-02-14 11:15:47,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 78 [2023-02-14 11:15:47,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:15:47,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2023-02-14 11:15:47,857 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:15:47,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2023-02-14 11:15:47,970 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-14 11:15:47,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 1 [2023-02-14 11:15:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:47,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739425611] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 11:15:47,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 11:15:47,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 29 [2023-02-14 11:15:47,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477052490] [2023-02-14 11:15:47,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 11:15:47,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-14 11:15:47,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:15:47,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-14 11:15:47,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2023-02-14 11:15:47,979 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 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) [2023-02-14 11:15:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:15:53,715 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2023-02-14 11:15:53,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-02-14 11:15:53,715 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 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 43 [2023-02-14 11:15:53,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:15:53,716 INFO L225 Difference]: With dead ends: 169 [2023-02-14 11:15:53,716 INFO L226 Difference]: Without dead ends: 154 [2023-02-14 11:15:53,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1518, Invalid=4334, Unknown=0, NotChecked=0, Total=5852 [2023-02-14 11:15:53,719 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 913 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 11:15:53,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 517 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 11:15:53,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-02-14 11:15:53,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 64. [2023-02-14 11:15:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 63 states have internal predecessors, (81), 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) [2023-02-14 11:15:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2023-02-14 11:15:53,727 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 43 [2023-02-14 11:15:53,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:15:53,727 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2023-02-14 11:15:53,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 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) [2023-02-14 11:15:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2023-02-14 11:15:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 11:15:53,729 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:15:53,729 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:15:53,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-14 11:15:53,934 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,SelfDestructingSolverStorable10 [2023-02-14 11:15:53,935 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:15:53,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:15:53,935 INFO L85 PathProgramCache]: Analyzing trace with hash -781342395, now seen corresponding path program 2 times [2023-02-14 11:15:53,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:15:53,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066321812] [2023-02-14 11:15:53,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:15:53,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:15:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:15:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:55,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:15:55,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066321812] [2023-02-14 11:15:55,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066321812] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:15:55,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696932924] [2023-02-14 11:15:55,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 11:15:55,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:15:55,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:15:55,013 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 11:15:55,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-14 11:15:55,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 11:15:55,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 11:15:55,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 82 conjunts are in the unsatisfiable core [2023-02-14 11:15:55,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:15:55,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 11:15:55,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:55,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:55,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 11:15:55,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:15:55,193 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 11:15:55,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2023-02-14 11:15:55,212 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 11:15:55,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-14 11:15:55,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:15:55,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:15:55,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:15:55,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:55,331 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 30 [2023-02-14 11:15:55,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:55,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2023-02-14 11:15:55,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:55,344 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-02-14 11:15:55,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 28 treesize of output 22 [2023-02-14 11:15:55,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:15:55,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 11:15:55,914 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2023-02-14 11:15:55,915 INFO L350 Elim1Store]: Elim1 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 163 treesize of output 149 [2023-02-14 11:15:55,979 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2023-02-14 11:15:55,980 INFO L350 Elim1Store]: Elim1 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 119 [2023-02-14 11:15:56,904 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2023-02-14 11:15:56,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2023-02-14 11:15:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:56,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 11:15:57,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:15:57,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2023-02-14 11:15:57,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:15:57,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2023-02-14 11:15:57,181 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:15:57,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 121 [2023-02-14 11:15:57,188 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:15:57,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 91 [2023-02-14 11:15:57,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 86 [2023-02-14 11:15:57,197 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:15:57,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 61 [2023-02-14 11:15:57,199 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:15:57,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2023-02-14 11:15:57,289 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-14 11:15:57,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 1 [2023-02-14 11:15:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:15:57,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696932924] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 11:15:57,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 11:15:57,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 25 [2023-02-14 11:15:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719466555] [2023-02-14 11:15:57,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 11:15:57,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-14 11:15:57,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:15:57,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-14 11:15:57,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=524, Unknown=5, NotChecked=0, Total=600 [2023-02-14 11:15:57,293 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:16:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:16:02,918 INFO L93 Difference]: Finished difference Result 160 states and 191 transitions. [2023-02-14 11:16:02,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-02-14 11:16:02,919 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-14 11:16:02,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:16:02,919 INFO L225 Difference]: With dead ends: 160 [2023-02-14 11:16:02,920 INFO L226 Difference]: Without dead ends: 158 [2023-02-14 11:16:02,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1772 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1573, Invalid=4742, Unknown=5, NotChecked=0, Total=6320 [2023-02-14 11:16:02,922 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 725 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 11:16:02,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 462 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 11:16:02,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-14 11:16:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 67. [2023-02-14 11:16:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 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) [2023-02-14 11:16:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2023-02-14 11:16:02,932 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 45 [2023-02-14 11:16:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:16:02,932 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2023-02-14 11:16:02,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:16:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2023-02-14 11:16:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 11:16:02,934 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:16:02,934 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:16:02,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-14 11:16:03,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:16:03,140 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:16:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:16:03,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2085516585, now seen corresponding path program 5 times [2023-02-14 11:16:03,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:16:03,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024586952] [2023-02-14 11:16:03,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:16:03,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:16:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:16:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:16:03,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:16:03,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024586952] [2023-02-14 11:16:03,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024586952] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:16:03,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530338082] [2023-02-14 11:16:03,922 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 11:16:03,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:16:03,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:16:03,925 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) [2023-02-14 11:16:03,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 11:16:04,311 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-14 11:16:04,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 11:16:04,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 96 conjunts are in the unsatisfiable core [2023-02-14 11:16:04,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:16:04,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:16:04,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 11:16:04,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:16:04,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:16:04,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:16:04,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:04,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 11:16:04,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:04,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 11:16:04,425 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 11:16:04,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-14 11:16:04,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:04,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:04,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 11:16:04,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:16:04,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:16:04,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:04,523 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-14 11:16:04,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2023-02-14 11:16:04,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:04,536 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-14 11:16:04,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 50 [2023-02-14 11:16:04,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:04,554 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-02-14 11:16:04,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 28 treesize of output 22 [2023-02-14 11:16:04,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 11:16:05,194 INFO L321 Elim1Store]: treesize reduction 85, result has 11.5 percent of original size [2023-02-14 11:16:05,195 INFO L350 Elim1Store]: Elim1 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 9 new quantified variables, introduced 10 case distinctions, treesize of input 150 treesize of output 88 [2023-02-14 11:16:05,207 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2023-02-14 11:16:05,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 35 [2023-02-14 11:16:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:16:05,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 11:16:05,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:05,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 129 [2023-02-14 11:16:05,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:05,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 111 [2023-02-14 11:16:06,197 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:06,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 387 treesize of output 367 [2023-02-14 11:16:06,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:06,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 360 treesize of output 340 [2023-02-14 11:16:06,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:06,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 333 treesize of output 302 [2023-02-14 11:16:06,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:06,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 509 treesize of output 643 [2023-02-14 11:16:06,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:06,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 369 treesize of output 372 [2023-02-14 11:16:06,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:06,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 333 treesize of output 336 [2023-02-14 11:16:11,042 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_25 0))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse4 v_arrayElimArr_27)) (.cse11 (store |c_#memory_$Pointer$.offset| .cse4 v_arrayElimArr_28))) (let ((.cse9 (store .cse11 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse6 (store .cse10 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse7 (select (select .cse6 .cse4) 0)) (.cse8 (select (select .cse9 .cse4) 0)) (.cse1 (store .cse11 v_prenex_9 v_prenex_7)) (.cse5 (store .cse10 v_prenex_9 v_prenex_8))) (let ((.cse2 (select (select .cse5 .cse4) 0)) (.cse3 (select (select .cse1 .cse4) 0)) (.cse0 (select (select .cse9 .cse7) .cse8))) (or (= .cse0 (select (select .cse1 .cse2) .cse3)) (= .cse4 (select (select .cse5 .cse2) .cse3)) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse4 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse0 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse4) 0)) (= (select (select .cse6 .cse7) .cse8) .cse4) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse14 (select v_prenex_8 0))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse14 v_arrayElimArr_27)) (.cse15 (store |c_#memory_$Pointer$.offset| .cse14 v_arrayElimArr_28))) (let ((.cse16 (store .cse15 v_prenex_9 v_prenex_7)) (.cse19 (store .cse13 v_prenex_9 v_prenex_8))) (let ((.cse17 (select (select .cse19 .cse14) 0)) (.cse18 (select (select .cse16 .cse14) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (let ((.cse12 (store .cse15 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse12 (select (select (store .cse13 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse14) 0)) (select (select .cse12 .cse14) 0))) 0) (not (= (select |c_#valid| .cse14) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse16 .cse17) .cse18) 0) (= (select (select .cse19 .cse17) .cse18) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse14 1) v_prenex_9) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse20 (select v_arrayElimArr_25 0))) (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse20 v_arrayElimArr_27)) (.cse23 (store |c_#memory_$Pointer$.offset| .cse20 v_arrayElimArr_28))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse20 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (let ((.cse21 (store .cse23 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse21 (select (select (store .cse22 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse20) 0)) (select (select .cse21 .cse20) 0))) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse20) 0)) (= (let ((.cse24 (store .cse23 v_prenex_9 v_prenex_7))) (select (select .cse24 (select (select (store .cse22 v_prenex_9 v_prenex_8) .cse20) 0)) (select (select .cse24 .cse20) 0))) 0) (not (= (select v_arrayElimArr_26 0) 0)))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse25 (select v_arrayElimArr_25 0))) (let ((.cse27 (store |c_#memory_$Pointer$.base| .cse25 v_arrayElimArr_27)) (.cse28 (store |c_#memory_$Pointer$.offset| .cse25 v_arrayElimArr_28))) (or (= .cse25 (select (let ((.cse26 (store .cse27 v_prenex_9 v_prenex_8))) (select .cse26 (select (select .cse26 .cse25) 0))) (select (select (store .cse28 v_prenex_9 v_prenex_7) .cse25) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse25 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (let ((.cse29 (store .cse28 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse29 (select (select (store .cse27 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse25) 0)) (select (select .cse29 .cse25) 0))) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse25) 0)) (not (= (select v_arrayElimArr_26 0) 0)))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse32 (select v_arrayElimArr_25 0))) (let ((.cse38 (store |c_#memory_$Pointer$.base| .cse32 v_arrayElimArr_27)) (.cse39 (store |c_#memory_$Pointer$.offset| .cse32 v_arrayElimArr_28))) (let ((.cse33 (store .cse39 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse36 (store .cse38 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse34 (select (select .cse36 .cse32) 0)) (.cse35 (select (select .cse33 .cse32) 0))) (let ((.cse31 (select (let ((.cse37 (store .cse38 v_prenex_9 v_prenex_8))) (select .cse37 (select (select .cse37 .cse32) 0))) (select (select (store .cse39 v_prenex_9 v_prenex_7) .cse32) 0))) (.cse30 (select (select .cse36 .cse34) .cse35))) (or (= .cse30 .cse31) (= .cse32 .cse31) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse32 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse33 .cse34) .cse35) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse32) 0)) (= .cse30 .cse32) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse40 (select v_prenex_8 0))) (let ((.cse43 (store |c_#memory_$Pointer$.base| .cse40 v_arrayElimArr_27)) (.cse44 (store |c_#memory_$Pointer$.offset| .cse40 v_arrayElimArr_28))) (let ((.cse41 (select (let ((.cse45 (store .cse43 v_prenex_9 v_prenex_8))) (select .cse45 (select (select .cse45 .cse40) 0))) (select (select (store .cse44 v_prenex_9 v_prenex_7) .cse40) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse40 .cse41) (not (= (select |c_#valid| .cse40) 0)) (= (select (let ((.cse42 (store .cse43 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse42 (select (select .cse42 .cse40) 0))) (select (select (store .cse44 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse40) 0)) .cse41) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse41 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse40 1) v_prenex_9) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse47 (select v_prenex_8 0))) (let ((.cse46 (select (let ((.cse48 (store (store |c_#memory_$Pointer$.base| .cse47 v_arrayElimArr_27) v_prenex_9 v_prenex_8))) (select .cse48 (select (select .cse48 .cse47) 0))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse47 v_arrayElimArr_28) v_prenex_9 v_prenex_7) .cse47) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_prenex_9 .cse46)) (not (= (select |c_#valid| .cse47) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse46 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse47 1) v_prenex_9) 0)))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse52 (select v_prenex_8 0))) (let ((.cse56 (store |c_#memory_$Pointer$.base| .cse52 v_arrayElimArr_27)) (.cse57 (store |c_#memory_$Pointer$.offset| .cse52 v_arrayElimArr_28))) (let ((.cse49 (store .cse57 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse54 (store .cse56 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse50 (select (select .cse54 .cse52) 0)) (.cse51 (select (select .cse49 .cse52) 0)) (.cse53 (select (let ((.cse55 (store .cse56 v_prenex_9 v_prenex_8))) (select .cse55 (select (select .cse55 .cse52) 0))) (select (select (store .cse57 v_prenex_9 v_prenex_7) .cse52) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select (select .cse49 .cse50) .cse51) 0) (= .cse52 .cse53) (not (= (select |c_#valid| .cse52) 0)) (= (select (select .cse54 .cse50) .cse51) .cse53) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse53 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse52 1) v_prenex_9) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse58 (select v_prenex_8 0))) (let ((.cse63 (store |c_#memory_$Pointer$.base| .cse58 v_arrayElimArr_27)) (.cse64 (store |c_#memory_$Pointer$.offset| .cse58 v_arrayElimArr_28))) (let ((.cse59 (store .cse64 v_prenex_9 v_prenex_7)) (.cse65 (store .cse63 v_prenex_9 v_prenex_8))) (let ((.cse60 (select (select .cse65 .cse58) 0)) (.cse61 (select (select .cse59 .cse58) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse58) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse59 .cse60) .cse61) 0) (= (select (let ((.cse62 (store .cse63 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse62 (select (select .cse62 .cse58) 0))) (select (select (store .cse64 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse58) 0)) .cse58) (= (select (select .cse65 .cse60) .cse61) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse58 1) v_prenex_9) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse69 (select v_arrayElimArr_25 0))) (let ((.cse68 (store |c_#memory_$Pointer$.base| .cse69 v_arrayElimArr_27)) (.cse70 (store |c_#memory_$Pointer$.offset| .cse69 v_arrayElimArr_28))) (let ((.cse74 (store .cse70 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse71 (store .cse68 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse72 (select (select .cse71 .cse69) 0)) (.cse73 (select (select .cse74 .cse69) 0))) (let ((.cse66 (select (select .cse74 .cse72) .cse73))) (or (= .cse66 (let ((.cse67 (store .cse70 v_prenex_9 v_prenex_7))) (select (select .cse67 (select (select (store .cse68 v_prenex_9 v_prenex_8) .cse69) 0)) (select (select .cse67 .cse69) 0)))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse69 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse66 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse69) 0)) (not (= (select (select .cse71 .cse72) .cse73) |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse79 (select v_arrayElimArr_25 0))) (let ((.cse80 (store |c_#memory_$Pointer$.base| .cse79 v_arrayElimArr_27)) (.cse81 (store |c_#memory_$Pointer$.offset| .cse79 v_arrayElimArr_28))) (let ((.cse82 (store .cse81 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse75 (store .cse80 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse76 (select (select .cse75 .cse79) 0)) (.cse77 (select (select .cse82 .cse79) 0))) (or (= (select (select .cse75 .cse76) .cse77) (select (let ((.cse78 (store .cse80 v_prenex_9 v_prenex_8))) (select .cse78 (select (select .cse78 .cse79) 0))) (select (select (store .cse81 v_prenex_9 v_prenex_7) .cse79) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse79 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse82 .cse76) .cse77) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse79) 0)) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse83 (select v_arrayElimArr_25 0))) (let ((.cse85 (store |c_#memory_$Pointer$.base| .cse83 v_arrayElimArr_27)) (.cse86 (store |c_#memory_$Pointer$.offset| .cse83 v_arrayElimArr_28))) (let ((.cse87 (store .cse86 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse90 (store .cse85 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse88 (select (select .cse90 .cse83) 0)) (.cse89 (select (select .cse87 .cse83) 0))) (or (= .cse83 (select (let ((.cse84 (store .cse85 v_prenex_9 v_prenex_8))) (select .cse84 (select (select .cse84 .cse83) 0))) (select (select (store .cse86 v_prenex_9 v_prenex_7) .cse83) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse83 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse87 .cse88) .cse89) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse83) 0)) (= (select (select .cse90 .cse88) .cse89) .cse83) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse91 (select v_prenex_8 0))) (let ((.cse97 (store |c_#memory_$Pointer$.base| .cse91 v_arrayElimArr_27)) (.cse98 (store |c_#memory_$Pointer$.offset| .cse91 v_arrayElimArr_28))) (let ((.cse93 (store .cse98 v_prenex_9 v_prenex_7)) (.cse99 (store .cse97 v_prenex_9 v_prenex_8))) (let ((.cse94 (select (select .cse99 .cse91) 0)) (.cse95 (select (select .cse93 .cse91) 0))) (let ((.cse92 (select (select .cse99 .cse94) .cse95))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse91 .cse92) (not (= (select |c_#valid| .cse91) 0)) (= (select (select .cse93 .cse94) .cse95) (let ((.cse96 (store .cse98 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse96 (select (select (store .cse97 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse91) 0)) (select (select .cse96 .cse91) 0)))) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse92 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse91 1) v_prenex_9) 0))))))))) (forall ((v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int)) (let ((.cse100 (select v_arrayElimArr_25 0))) (let ((.cse101 (store (store |c_#memory_$Pointer$.offset| .cse100 v_arrayElimArr_28) |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse104 (store (store |c_#memory_$Pointer$.base| .cse100 v_arrayElimArr_27) |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse102 (select (select .cse104 .cse100) 0)) (.cse103 (select (select .cse101 .cse100) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse100 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse101 .cse102) .cse103) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse100) 0)) (not (= (select (select .cse104 .cse102) .cse103) |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse108 (select v_prenex_8 0))) (let ((.cse115 (store |c_#memory_$Pointer$.base| .cse108 v_arrayElimArr_27)) (.cse116 (store |c_#memory_$Pointer$.offset| .cse108 v_arrayElimArr_28))) (let ((.cse111 (store .cse116 v_prenex_9 v_prenex_7)) (.cse114 (store .cse115 v_prenex_9 v_prenex_8))) (let ((.cse112 (select (select .cse114 .cse108) 0)) (.cse113 (select (select .cse111 .cse108) 0)) (.cse105 (store .cse116 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse109 (store .cse115 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse106 (select (select .cse109 .cse108) 0)) (.cse107 (select (select .cse105 .cse108) 0)) (.cse110 (select (select .cse114 .cse112) .cse113))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select (select .cse105 .cse106) .cse107) 0) (not (= (select |c_#valid| .cse108) 0)) (= (select (select .cse109 .cse106) .cse107) .cse110) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse111 .cse112) .cse113) 0) (= .cse110 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse108 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse121 (select v_arrayElimArr_25 0))) (let ((.cse127 (store |c_#memory_$Pointer$.base| .cse121 v_arrayElimArr_27)) (.cse128 (store |c_#memory_$Pointer$.offset| .cse121 v_arrayElimArr_28))) (let ((.cse126 (store .cse128 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse123 (store .cse127 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse124 (select (select .cse123 .cse121) 0)) (.cse125 (select (select .cse126 .cse121) 0)) (.cse118 (store .cse128 v_prenex_9 v_prenex_7)) (.cse122 (store .cse127 v_prenex_9 v_prenex_8))) (let ((.cse119 (select (select .cse122 .cse121) 0)) (.cse120 (select (select .cse118 .cse121) 0)) (.cse117 (select (select .cse126 .cse124) .cse125))) (or (= .cse117 (select (select .cse118 .cse119) .cse120)) (= .cse121 (select (select .cse122 .cse119) .cse120)) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse121 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse117 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse121) 0)) (not (= (select (select .cse123 .cse124) .cse125) |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse131 (select v_arrayElimArr_25 0))) (let ((.cse137 (store |c_#memory_$Pointer$.base| .cse131 v_arrayElimArr_27)) (.cse138 (store |c_#memory_$Pointer$.offset| .cse131 v_arrayElimArr_28))) (let ((.cse132 (store .cse138 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse135 (store .cse137 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse133 (select (select .cse135 .cse131) 0)) (.cse134 (select (select .cse132 .cse131) 0))) (let ((.cse130 (select (let ((.cse136 (store .cse137 v_prenex_9 v_prenex_8))) (select .cse136 (select (select .cse136 .cse131) 0))) (select (select (store .cse138 v_prenex_9 v_prenex_7) .cse131) 0))) (.cse129 (select (select .cse135 .cse133) .cse134))) (or (= .cse129 .cse130) (= .cse131 .cse130) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse131 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse132 .cse133) .cse134) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse131) 0)) (not (= .cse129 |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse140 (select v_prenex_8 0))) (let ((.cse141 (store (store |c_#memory_$Pointer$.offset| .cse140 v_arrayElimArr_28) v_prenex_9 v_prenex_7)) (.cse144 (store (store |c_#memory_$Pointer$.base| .cse140 v_arrayElimArr_27) v_prenex_9 v_prenex_8))) (let ((.cse142 (select (select .cse144 .cse140) 0)) (.cse143 (select (select .cse141 .cse140) 0))) (let ((.cse139 (select (select .cse144 .cse142) .cse143))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_prenex_9 .cse139)) (not (= (select |c_#valid| .cse140) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse141 .cse142) .cse143) 0) (= .cse139 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse140 1) v_prenex_9) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse145 (select v_prenex_8 0))) (let ((.cse155 (store |c_#memory_$Pointer$.base| .cse145 v_arrayElimArr_27)) (.cse156 (store |c_#memory_$Pointer$.offset| .cse145 v_arrayElimArr_28))) (let ((.cse147 (store .cse156 v_prenex_9 v_prenex_7)) (.cse154 (store .cse155 v_prenex_9 v_prenex_8))) (let ((.cse148 (select (select .cse154 .cse145) 0)) (.cse149 (select (select .cse147 .cse145) 0)) (.cse150 (store .cse156 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse153 (store .cse155 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse151 (select (select .cse153 .cse145) 0)) (.cse152 (select (select .cse150 .cse145) 0)) (.cse146 (select (select .cse154 .cse148) .cse149))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse145 .cse146) (not (= (select |c_#valid| .cse145) 0)) (= (select (select .cse147 .cse148) .cse149) (select (select .cse150 .cse151) .cse152)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse153 .cse151) .cse152) .cse145) (= .cse146 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse145 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse160 (select v_arrayElimArr_25 0))) (let ((.cse159 (store |c_#memory_$Pointer$.base| .cse160 v_arrayElimArr_27)) (.cse161 (store |c_#memory_$Pointer$.offset| .cse160 v_arrayElimArr_28))) (let ((.cse157 (let ((.cse162 (store .cse161 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse162 (select (select (store .cse159 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse160) 0)) (select (select .cse162 .cse160) 0))))) (or (= .cse157 (let ((.cse158 (store .cse161 v_prenex_9 v_prenex_7))) (select (select .cse158 (select (select (store .cse159 v_prenex_9 v_prenex_8) .cse160) 0)) (select (select .cse158 .cse160) 0)))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse160 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse157 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse160) 0)) (not (= (select v_arrayElimArr_26 0) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse167 (select v_arrayElimArr_25 0))) (let ((.cse170 (store |c_#memory_$Pointer$.base| .cse167 v_arrayElimArr_27)) (.cse171 (store |c_#memory_$Pointer$.offset| .cse167 v_arrayElimArr_28))) (let ((.cse164 (store .cse171 v_prenex_9 v_prenex_7)) (.cse168 (store .cse170 v_prenex_9 v_prenex_8))) (let ((.cse165 (select (select .cse168 .cse167) 0)) (.cse166 (select (select .cse164 .cse167) 0)) (.cse163 (let ((.cse169 (store .cse171 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse169 (select (select (store .cse170 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse167) 0)) (select (select .cse169 .cse167) 0))))) (or (= .cse163 (select (select .cse164 .cse165) .cse166)) (= .cse167 (select (select .cse168 .cse165) .cse166)) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse167 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse163 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse167) 0)) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse176 (select v_arrayElimArr_25 0))) (let ((.cse179 (store |c_#memory_$Pointer$.base| .cse176 v_arrayElimArr_27)) (.cse180 (store |c_#memory_$Pointer$.offset| .cse176 v_arrayElimArr_28))) (let ((.cse177 (store .cse180 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse172 (store .cse179 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse175 (select (let ((.cse178 (store .cse179 v_prenex_9 v_prenex_8))) (select .cse178 (select (select .cse178 .cse176) 0))) (select (select (store .cse180 v_prenex_9 v_prenex_7) .cse176) 0))) (.cse173 (select (select .cse172 .cse176) 0)) (.cse174 (select (select .cse177 .cse176) 0))) (or (= (select (select .cse172 .cse173) .cse174) .cse175) (= .cse176 .cse175) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse176 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse177 .cse173) .cse174) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse176) 0)) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse181 (select v_prenex_8 0))) (let ((.cse183 (store |c_#memory_$Pointer$.base| .cse181 v_arrayElimArr_27)) (.cse184 (store |c_#memory_$Pointer$.offset| .cse181 v_arrayElimArr_28))) (let ((.cse186 (store .cse184 v_prenex_9 v_prenex_7)) (.cse189 (store .cse183 v_prenex_9 v_prenex_8))) (let ((.cse187 (select (select .cse189 .cse181) 0)) (.cse188 (select (select .cse186 .cse181) 0))) (let ((.cse185 (select (select .cse189 .cse187) .cse188))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse181) 0)) (= (select (let ((.cse182 (store .cse183 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse182 (select (select .cse182 .cse181) 0))) (select (select (store .cse184 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse181) 0)) .cse185) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse186 .cse187) .cse188) 0) (= .cse185 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse181 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse190 (select v_prenex_8 0))) (let ((.cse200 (store |c_#memory_$Pointer$.base| .cse190 v_arrayElimArr_27)) (.cse201 (store |c_#memory_$Pointer$.offset| .cse190 v_arrayElimArr_28))) (let ((.cse199 (store .cse201 v_prenex_9 v_prenex_7)) (.cse196 (store .cse200 v_prenex_9 v_prenex_8))) (let ((.cse192 (store .cse201 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse195 (store .cse200 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25)) (.cse197 (select (select .cse196 .cse190) 0)) (.cse198 (select (select .cse199 .cse190) 0))) (let ((.cse191 (select (select .cse199 .cse197) .cse198)) (.cse193 (select (select .cse195 .cse190) 0)) (.cse194 (select (select .cse192 .cse190) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse190) 0)) (= .cse191 (select (select .cse192 .cse193) .cse194)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse191 0) (= (select (select .cse195 .cse193) .cse194) .cse190) (= (select (select .cse196 .cse197) .cse198) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse190 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse202 (select v_prenex_8 0))) (let ((.cse205 (store |c_#memory_$Pointer$.base| .cse202 v_arrayElimArr_27)) (.cse206 (store |c_#memory_$Pointer$.offset| .cse202 v_arrayElimArr_28))) (let ((.cse203 (select (let ((.cse207 (store .cse205 v_prenex_9 v_prenex_8))) (select .cse207 (select (select .cse207 .cse202) 0))) (select (select (store .cse206 v_prenex_9 v_prenex_7) .cse202) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse202 .cse203) (not (= (select |c_#valid| .cse202) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (let ((.cse204 (store .cse205 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse204 (select (select .cse204 .cse202) 0))) (select (select (store .cse206 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse202) 0)) .cse202) (= .cse203 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse202 1) v_prenex_9) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse208 (select v_prenex_8 0))) (let ((.cse212 (store |c_#memory_$Pointer$.base| .cse208 v_arrayElimArr_27)) (.cse213 (store |c_#memory_$Pointer$.offset| .cse208 v_arrayElimArr_28))) (let ((.cse210 (select (let ((.cse214 (store .cse212 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse214 (select (select .cse214 .cse208) 0))) (select (select (store .cse213 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse208) 0))) (.cse209 (select (let ((.cse211 (store .cse212 v_prenex_9 v_prenex_8))) (select .cse211 (select (select .cse211 .cse208) 0))) (select (select (store .cse213 v_prenex_9 v_prenex_7) .cse208) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse208 .cse209) (not (= (select |c_#valid| .cse208) 0)) (= .cse210 .cse209) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse210 .cse208) (= .cse209 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse208 1) v_prenex_9) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse215 (select v_prenex_8 0))) (let ((.cse218 (store |c_#memory_$Pointer$.base| .cse215 v_arrayElimArr_27)) (.cse219 (store |c_#memory_$Pointer$.offset| .cse215 v_arrayElimArr_28))) (let ((.cse223 (store .cse219 v_prenex_9 v_prenex_7)) (.cse220 (store .cse218 v_prenex_9 v_prenex_8))) (let ((.cse221 (select (select .cse220 .cse215) 0)) (.cse222 (select (select .cse223 .cse215) 0))) (let ((.cse216 (select (select .cse223 .cse221) .cse222))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse215) 0)) (= .cse216 (let ((.cse217 (store .cse219 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse217 (select (select (store .cse218 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse215) 0)) (select (select .cse217 .cse215) 0)))) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse216 0) (= (select (select .cse220 .cse221) .cse222) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse215 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse224 (select v_arrayElimArr_25 0))) (let ((.cse230 (store |c_#memory_$Pointer$.base| .cse224 v_arrayElimArr_27)) (.cse231 (store |c_#memory_$Pointer$.offset| .cse224 v_arrayElimArr_28))) (let ((.cse225 (store .cse231 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse228 (store .cse230 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse226 (select (select .cse228 .cse224) 0)) (.cse227 (select (select .cse225 .cse224) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse224 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse225 .cse226) .cse227) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse224) 0)) (= (select (select .cse228 .cse226) .cse227) .cse224) (= (let ((.cse229 (store .cse231 v_prenex_9 v_prenex_7))) (select (select .cse229 (select (select (store .cse230 v_prenex_9 v_prenex_8) .cse224) 0)) (select (select .cse229 .cse224) 0))) 0) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse234 (select v_prenex_8 0))) (let ((.cse233 (store |c_#memory_$Pointer$.base| .cse234 v_arrayElimArr_27)) (.cse235 (store |c_#memory_$Pointer$.offset| .cse234 v_arrayElimArr_28))) (let ((.cse236 (select (let ((.cse237 (store .cse233 v_prenex_9 v_prenex_8))) (select .cse237 (select (select .cse237 .cse234) 0))) (select (select (store .cse235 v_prenex_9 v_prenex_7) .cse234) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (let ((.cse232 (store .cse235 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse232 (select (select (store .cse233 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse234) 0)) (select (select .cse232 .cse234) 0))) 0) (= .cse234 .cse236) (not (= (select |c_#valid| .cse234) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse236 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse234 1) v_prenex_9) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse241 (select v_arrayElimArr_25 0))) (let ((.cse240 (store |c_#memory_$Pointer$.base| .cse241 v_arrayElimArr_27)) (.cse242 (store |c_#memory_$Pointer$.offset| .cse241 v_arrayElimArr_28))) (let ((.cse246 (store .cse242 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse243 (store .cse240 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse244 (select (select .cse243 .cse241) 0)) (.cse245 (select (select .cse246 .cse241) 0))) (let ((.cse238 (select (select .cse246 .cse244) .cse245))) (or (= .cse238 (let ((.cse239 (store .cse242 v_prenex_9 v_prenex_7))) (select (select .cse239 (select (select (store .cse240 v_prenex_9 v_prenex_8) .cse241) 0)) (select (select .cse239 .cse241) 0)))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse241 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse238 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse241) 0)) (= (select (select .cse243 .cse244) .cse245) .cse241) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse249 (select v_arrayElimArr_25 0))) (let ((.cse250 (store |c_#memory_$Pointer$.base| .cse249 v_arrayElimArr_27)) (.cse251 (store |c_#memory_$Pointer$.offset| .cse249 v_arrayElimArr_28))) (let ((.cse252 (store .cse251 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse255 (store .cse250 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse253 (select (select .cse255 .cse249) 0)) (.cse254 (select (select .cse252 .cse249) 0))) (let ((.cse247 (select (select .cse255 .cse253) .cse254))) (or (= .cse247 (select (let ((.cse248 (store .cse250 v_prenex_9 v_prenex_8))) (select .cse248 (select (select .cse248 .cse249) 0))) (select (select (store .cse251 v_prenex_9 v_prenex_7) .cse249) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse249 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse252 .cse253) .cse254) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse249) 0)) (not (= .cse247 |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse258 (select v_arrayElimArr_25 0))) (let ((.cse259 (store |c_#memory_$Pointer$.base| .cse258 v_arrayElimArr_27)) (.cse260 (store |c_#memory_$Pointer$.offset| .cse258 v_arrayElimArr_28))) (let ((.cse261 (store .cse260 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse264 (store .cse259 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse262 (select (select .cse264 .cse258) 0)) (.cse263 (select (select .cse261 .cse258) 0))) (let ((.cse256 (select (select .cse264 .cse262) .cse263))) (or (= .cse256 (select (let ((.cse257 (store .cse259 v_prenex_9 v_prenex_8))) (select .cse257 (select (select .cse257 .cse258) 0))) (select (select (store .cse260 v_prenex_9 v_prenex_7) .cse258) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse258 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse261 .cse262) .cse263) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse258) 0)) (= .cse256 .cse258) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse265 (select v_prenex_8 0))) (let ((.cse273 (store |c_#memory_$Pointer$.base| .cse265 v_arrayElimArr_27)) (.cse274 (store |c_#memory_$Pointer$.offset| .cse265 v_arrayElimArr_28))) (let ((.cse268 (store .cse274 v_prenex_9 v_prenex_7)) (.cse271 (store .cse273 v_prenex_9 v_prenex_8))) (let ((.cse269 (select (select .cse271 .cse265) 0)) (.cse270 (select (select .cse268 .cse265) 0))) (let ((.cse266 (select (let ((.cse272 (store .cse273 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse272 (select (select .cse272 .cse265) 0))) (select (select (store .cse274 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse265) 0))) (.cse267 (select (select .cse271 .cse269) .cse270))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse265) 0)) (= .cse266 .cse267) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse268 .cse269) .cse270) 0) (= .cse266 .cse265) (= .cse267 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse265 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse276 (select v_prenex_8 0))) (let ((.cse283 (store |c_#memory_$Pointer$.base| .cse276 v_arrayElimArr_27)) (.cse284 (store |c_#memory_$Pointer$.offset| .cse276 v_arrayElimArr_28))) (let ((.cse281 (store .cse284 v_prenex_9 v_prenex_7)) (.cse278 (store .cse283 v_prenex_9 v_prenex_8))) (let ((.cse279 (select (select .cse278 .cse276) 0)) (.cse280 (select (select .cse281 .cse276) 0))) (let ((.cse275 (let ((.cse282 (store .cse284 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse282 (select (select (store .cse283 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse276) 0)) (select (select .cse282 .cse276) 0)))) (.cse277 (select (select .cse281 .cse279) .cse280))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse275 0) (not (= (select |c_#valid| .cse276) 0)) (= .cse277 .cse275) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse277 0) (= (select (select .cse278 .cse279) .cse280) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse276 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse286 (select v_prenex_8 0))) (let ((.cse293 (store |c_#memory_$Pointer$.base| .cse286 v_arrayElimArr_27)) (.cse294 (store |c_#memory_$Pointer$.offset| .cse286 v_arrayElimArr_28))) (let ((.cse288 (store .cse294 v_prenex_9 v_prenex_7)) (.cse291 (store .cse293 v_prenex_9 v_prenex_8))) (let ((.cse289 (select (select .cse291 .cse286) 0)) (.cse290 (select (select .cse288 .cse286) 0))) (let ((.cse285 (let ((.cse292 (store .cse294 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse292 (select (select (store .cse293 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse286) 0)) (select (select .cse292 .cse286) 0)))) (.cse287 (select (select .cse291 .cse289) .cse290))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse285 0) (= .cse286 .cse287) (not (= (select |c_#valid| .cse286) 0)) (= (select (select .cse288 .cse289) .cse290) .cse285) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse287 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse286 1) v_prenex_9) 0)))))))))) is different from false [2023-02-14 11:16:15,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:15,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 216 [2023-02-14 11:16:15,815 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:15,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 144 [2023-02-14 11:16:15,823 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:15,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:15,854 INFO L321 Elim1Store]: treesize reduction 43, result has 53.3 percent of original size [2023-02-14 11:16:15,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 863 treesize of output 785 [2023-02-14 11:16:15,869 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:15,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 657 treesize of output 651 [2023-02-14 11:16:15,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 670 treesize of output 491 [2023-02-14 11:16:15,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:15,910 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 365 treesize of output 315 [2023-02-14 11:16:15,929 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:15,930 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 210 treesize of output 192 [2023-02-14 11:16:15,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2023-02-14 11:16:15,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2023-02-14 11:16:15,968 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:15,969 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:15,976 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 11:16:15,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 12 [2023-02-14 11:16:16,115 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:16,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 197 [2023-02-14 11:16:16,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:16,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 137 [2023-02-14 11:16:16,130 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:16,130 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:16,131 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:16,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:16,162 INFO L321 Elim1Store]: treesize reduction 43, result has 53.3 percent of original size [2023-02-14 11:16:16,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 871 treesize of output 633 [2023-02-14 11:16:16,175 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:16,176 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:16,177 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:16,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 650 treesize of output 636 [2023-02-14 11:16:16,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 652 treesize of output 526 [2023-02-14 11:16:16,213 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:16,213 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 521 treesize of output 483 [2023-02-14 11:16:16,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:16,231 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 450 treesize of output 400 [2023-02-14 11:16:16,248 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 11:16:16,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2023-02-14 11:16:16,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2023-02-14 11:16:16,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2023-02-14 11:16:16,565 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 396 treesize of output 1 [2023-02-14 11:16:16,574 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 393 treesize of output 1 [2023-02-14 11:16:16,582 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 1 [2023-02-14 11:16:16,593 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 1 [2023-02-14 11:16:16,602 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 1 [2023-02-14 11:16:16,611 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 1 [2023-02-14 11:16:16,619 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 1 [2023-02-14 11:16:16,627 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 1 [2023-02-14 11:16:16,633 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 1 [2023-02-14 11:16:16,641 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 1 [2023-02-14 11:16:16,648 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2023-02-14 11:16:16,655 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 1 [2023-02-14 11:16:16,672 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 1 [2023-02-14 11:16:16,680 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 1 [2023-02-14 11:16:16,687 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 1 [2023-02-14 11:16:16,694 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2023-02-14 11:16:16,701 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2023-02-14 11:16:16,708 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 1 [2023-02-14 11:16:16,715 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 1 [2023-02-14 11:16:16,721 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 1 [2023-02-14 11:16:16,728 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2023-02-14 11:16:16,735 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 315 treesize of output 1 [2023-02-14 11:16:16,743 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 1 [2023-02-14 11:16:16,750 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2023-02-14 11:16:16,758 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 315 treesize of output 1 [2023-02-14 11:16:16,764 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 1 [2023-02-14 11:16:16,771 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2023-02-14 11:16:16,778 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 393 treesize of output 1 [2023-02-14 11:16:16,785 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2023-02-14 11:16:16,792 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2023-02-14 11:16:16,798 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2023-02-14 11:16:16,805 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 1 [2023-02-14 11:16:16,816 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 11:16:16,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 396 treesize of output 1 [2023-02-14 11:16:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-02-14 11:16:16,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530338082] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 11:16:16,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 11:16:16,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 16] total 36 [2023-02-14 11:16:16,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040460708] [2023-02-14 11:16:16,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 11:16:16,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-14 11:16:16,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:16:16,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-14 11:16:16,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1067, Unknown=1, NotChecked=66, Total=1260 [2023-02-14 11:16:16,836 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 36 states, 36 states have (on average 3.7222222222222223) internal successors, (134), 36 states have internal predecessors, (134), 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) [2023-02-14 11:16:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:16:20,185 INFO L93 Difference]: Finished difference Result 200 states and 243 transitions. [2023-02-14 11:16:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-14 11:16:20,186 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.7222222222222223) internal successors, (134), 36 states have internal predecessors, (134), 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 51 [2023-02-14 11:16:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:16:20,187 INFO L225 Difference]: With dead ends: 200 [2023-02-14 11:16:20,187 INFO L226 Difference]: Without dead ends: 129 [2023-02-14 11:16:20,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=523, Invalid=4172, Unknown=1, NotChecked=134, Total=4830 [2023-02-14 11:16:20,189 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 124 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-14 11:16:20,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1212 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 934 Invalid, 0 Unknown, 90 Unchecked, 1.0s Time] [2023-02-14 11:16:20,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-14 11:16:20,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 95. [2023-02-14 11:16:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 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) [2023-02-14 11:16:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2023-02-14 11:16:20,209 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 51 [2023-02-14 11:16:20,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:16:20,210 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2023-02-14 11:16:20,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.7222222222222223) internal successors, (134), 36 states have internal predecessors, (134), 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) [2023-02-14 11:16:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2023-02-14 11:16:20,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-14 11:16:20,213 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:16:20,214 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:16:20,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-14 11:16:20,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:16:20,421 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:16:20,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:16:20,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1013477057, now seen corresponding path program 6 times [2023-02-14 11:16:20,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:16:20,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299009906] [2023-02-14 11:16:20,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:16:20,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:16:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:16:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:16:23,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:16:23,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299009906] [2023-02-14 11:16:23,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299009906] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:16:23,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88378833] [2023-02-14 11:16:23,053 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 11:16:23,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:16:23,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:16:23,054 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) [2023-02-14 11:16:23,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 11:16:23,437 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-02-14 11:16:23,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 11:16:23,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 106 conjunts are in the unsatisfiable core [2023-02-14 11:16:23,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:16:23,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 11:16:23,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:23,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:23,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 11:16:23,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:16:23,557 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 11:16:23,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-14 11:16:23,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-02-14 11:16:23,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:16:23,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:16:23,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:16:23,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:23,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2023-02-14 11:16:23,711 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-14 11:16:23,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2023-02-14 11:16:23,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:23,742 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2023-02-14 11:16:23,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2023-02-14 11:16:23,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:23,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 11:16:23,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:16:23,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:16:23,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:23,970 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-14 11:16:23,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 83 [2023-02-14 11:16:23,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:23,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:23,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:23,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-02-14 11:16:23,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:23,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:23,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:24,000 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2023-02-14 11:16:24,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-02-14 11:16:24,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2023-02-14 11:16:25,380 INFO L321 Elim1Store]: treesize reduction 236, result has 45.0 percent of original size [2023-02-14 11:16:25,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 297 treesize of output 321 [2023-02-14 11:16:25,584 INFO L321 Elim1Store]: treesize reduction 224, result has 38.6 percent of original size [2023-02-14 11:16:25,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 193 treesize of output 275 [2023-02-14 11:16:30,386 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2023-02-14 11:16:30,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2023-02-14 11:16:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:16:30,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 11:16:30,778 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:30,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 135 [2023-02-14 11:16:30,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:30,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 117 [2023-02-14 11:16:30,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:30,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 251 [2023-02-14 11:16:30,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:30,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 221 [2023-02-14 11:16:30,975 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_40| Int) (v_ArrVal_921 (Array Int Int)) (v_ArrVal_914 (Array Int Int)) (v_arrayElimArr_71 (Array Int Int)) (v_arrayElimArr_73 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int)) (v_arrayElimArr_74 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_71 0))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 v_arrayElimArr_74) |v_ULTIMATE.start_main_~l~0#1.base_40| v_arrayElimArr_72)) (.cse7 (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_73) |v_ULTIMATE.start_main_~l~0#1.base_40| v_arrayElimArr_71)) (.cse1 (select v_arrayElimArr_72 0))) (let ((.cse5 (select (select .cse7 .cse0) .cse1)) (.cse6 (select (select .cse4 .cse0) .cse1))) (let ((.cse2 (select (store (store |c_#memory_int| .cse0 v_ArrVal_914) |v_ULTIMATE.start_main_~l~0#1.base_40| v_ArrVal_921) (select (select .cse7 .cse5) .cse6))) (.cse3 (select (select .cse4 .cse5) .cse6))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_74 .cse1))) (not (= (select v_arrayElimArr_73 .cse1) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= .cse1 0)) (not (= (select .cse2 (+ .cse3 8)) 3)) (not (= (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_main_~l~0#1.base_40|) 0)) (not (= (select .cse2 (+ .cse3 4)) 1)))))))) is different from false [2023-02-14 11:16:31,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:31,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 467 treesize of output 363 [2023-02-14 11:16:31,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:16:31,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 347 treesize of output 243 [2023-02-14 11:16:31,087 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:31,089 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:31,089 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:31,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:31,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 119 [2023-02-14 11:16:31,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 142 [2023-02-14 11:16:31,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104 [2023-02-14 11:16:31,109 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:31,110 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:31,110 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:16:31,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2023-02-14 11:16:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-02-14 11:16:31,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88378833] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 11:16:31,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 11:16:31,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 39 [2023-02-14 11:16:31,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559463045] [2023-02-14 11:16:31,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 11:16:31,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-14 11:16:31,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:16:31,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-14 11:16:31,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1302, Unknown=3, NotChecked=72, Total=1482 [2023-02-14 11:16:31,271 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 39 states have internal predecessors, (149), 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) [2023-02-14 11:16:53,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:16:53,512 INFO L93 Difference]: Finished difference Result 351 states and 426 transitions. [2023-02-14 11:16:53,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2023-02-14 11:16:53,513 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 39 states have internal predecessors, (149), 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 56 [2023-02-14 11:16:53,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:16:53,514 INFO L225 Difference]: With dead ends: 351 [2023-02-14 11:16:53,514 INFO L226 Difference]: Without dead ends: 311 [2023-02-14 11:16:53,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 133 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5121 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=3925, Invalid=13898, Unknown=3, NotChecked=264, Total=18090 [2023-02-14 11:16:53,518 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 2559 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2559 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-14 11:16:53,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2559 Valid, 804 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 691 Invalid, 0 Unknown, 133 Unchecked, 1.1s Time] [2023-02-14 11:16:53,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-02-14 11:16:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 95. [2023-02-14 11:16:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 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) [2023-02-14 11:16:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2023-02-14 11:16:53,533 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 56 [2023-02-14 11:16:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:16:53,534 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2023-02-14 11:16:53,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 39 states have internal predecessors, (149), 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) [2023-02-14 11:16:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2023-02-14 11:16:53,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-14 11:16:53,535 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:16:53,535 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:16:53,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-14 11:16:53,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-14 11:16:53,741 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:16:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:16:53,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1512229753, now seen corresponding path program 3 times [2023-02-14 11:16:53,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:16:53,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126944750] [2023-02-14 11:16:53,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:16:53,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:16:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:16:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:16:55,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:16:55,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126944750] [2023-02-14 11:16:55,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126944750] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:16:55,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406530479] [2023-02-14 11:16:55,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 11:16:55,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:16:55,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:16:55,229 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 11:16:55,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 11:16:55,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-14 11:16:55,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 11:16:55,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 108 conjunts are in the unsatisfiable core [2023-02-14 11:16:55,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:16:55,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 11:16:55,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:55,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:55,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 11:16:55,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:16:55,755 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 11:16:55,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-14 11:16:55,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-02-14 11:16:55,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:16:55,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:16:55,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:16:55,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:55,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2023-02-14 11:16:55,874 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-14 11:16:55,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2023-02-14 11:16:55,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:55,897 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2023-02-14 11:16:55,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2023-02-14 11:16:55,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:55,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 11:16:56,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:16:56,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:16:56,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:56,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:56,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:56,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2023-02-14 11:16:56,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:56,061 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-14 11:16:56,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 83 [2023-02-14 11:16:56,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:56,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:56,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:16:56,072 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2023-02-14 11:16:56,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-02-14 11:16:56,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2023-02-14 11:16:57,291 INFO L321 Elim1Store]: treesize reduction 252, result has 41.3 percent of original size [2023-02-14 11:16:57,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 297 treesize of output 305 [2023-02-14 11:16:57,526 INFO L321 Elim1Store]: treesize reduction 196, result has 46.3 percent of original size [2023-02-14 11:16:57,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 177 treesize of output 291 [2023-02-14 11:17:01,707 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2023-02-14 11:17:01,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2023-02-14 11:17:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:17:01,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 11:17:01,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:01,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 135 [2023-02-14 11:17:01,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:01,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 117 [2023-02-14 11:17:02,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:02,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 221 [2023-02-14 11:17:02,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:02,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 203 [2023-02-14 11:17:02,105 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_82 (Array Int Int)) (v_arrayElimArr_81 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_47| Int) (v_ArrVal_1087 (Array Int Int)) (v_arrayElimArr_84 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_arrayElimArr_83 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_81 0))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse0 v_arrayElimArr_83) |v_ULTIMATE.start_main_~l~0#1.base_47| v_arrayElimArr_82)) (.cse6 (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_84) |v_ULTIMATE.start_main_~l~0#1.base_47| v_arrayElimArr_81))) (let ((.cse4 (select (select .cse6 .cse0) 0)) (.cse5 (select (select .cse3 .cse0) 0))) (let ((.cse1 (select (store (store |c_#memory_int| .cse0 v_ArrVal_1087) |v_ULTIMATE.start_main_~l~0#1.base_47| v_ArrVal_1097) (select (select .cse6 .cse4) .cse5))) (.cse2 (select (select .cse3 .cse4) .cse5))) (or (not (= (select v_arrayElimArr_83 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0)) (not (= (select v_arrayElimArr_84 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select v_arrayElimArr_82 0) 0)) (not (= (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_main_~l~0#1.base_47|) 0)) (not (= (select .cse1 (+ .cse2 4)) 0)) (not (= 2 (select .cse1 (+ .cse2 8)))))))))) is different from false [2023-02-14 11:17:02,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:02,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 375 treesize of output 303 [2023-02-14 11:17:02,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:02,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 219 [2023-02-14 11:17:02,241 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:02,242 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:02,243 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:02,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:02,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 107 [2023-02-14 11:17:02,253 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:02,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 689 treesize of output 649 [2023-02-14 11:17:02,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 682 treesize of output 572 [2023-02-14 11:17:02,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 566 treesize of output 466 [2023-02-14 11:17:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-02-14 11:17:02,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406530479] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 11:17:02,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 11:17:02,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 32 [2023-02-14 11:17:02,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746025873] [2023-02-14 11:17:02,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 11:17:02,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-14 11:17:02,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:17:02,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-14 11:17:02,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=836, Unknown=8, NotChecked=58, Total=992 [2023-02-14 11:17:02,622 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 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) [2023-02-14 11:17:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:17:15,996 INFO L93 Difference]: Finished difference Result 251 states and 302 transitions. [2023-02-14 11:17:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-02-14 11:17:15,996 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 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 58 [2023-02-14 11:17:15,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:17:15,997 INFO L225 Difference]: With dead ends: 251 [2023-02-14 11:17:15,997 INFO L226 Difference]: Without dead ends: 249 [2023-02-14 11:17:15,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3033 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=2464, Invalid=8244, Unknown=8, NotChecked=204, Total=10920 [2023-02-14 11:17:15,999 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1206 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-14 11:17:16,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 579 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 619 Invalid, 0 Unknown, 117 Unchecked, 0.9s Time] [2023-02-14 11:17:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-02-14 11:17:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 106. [2023-02-14 11:17:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 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) [2023-02-14 11:17:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 136 transitions. [2023-02-14 11:17:16,022 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 136 transitions. Word has length 58 [2023-02-14 11:17:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:17:16,022 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 136 transitions. [2023-02-14 11:17:16,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 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) [2023-02-14 11:17:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 136 transitions. [2023-02-14 11:17:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-14 11:17:16,023 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:17:16,023 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:17:16,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-14 11:17:16,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-14 11:17:16,231 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:17:16,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:17:16,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1492842773, now seen corresponding path program 7 times [2023-02-14 11:17:16,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:17:16,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431103744] [2023-02-14 11:17:16,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:17:16,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:17:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:17:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:17:17,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:17:17,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431103744] [2023-02-14 11:17:17,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431103744] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:17:17,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441424107] [2023-02-14 11:17:17,539 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-14 11:17:17,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:17:17,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:17:17,541 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 11:17:17,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-14 11:17:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:17:17,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 108 conjunts are in the unsatisfiable core [2023-02-14 11:17:17,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:17:17,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:17:17,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:17:17,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 11:17:17,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:17:17,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:17:17,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:17,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-14 11:17:17,799 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 11:17:17,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-02-14 11:17:17,820 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 11:17:17,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-14 11:17:17,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:17:17,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:17:17,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:17,928 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-14 11:17:17,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2023-02-14 11:17:17,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:17,942 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-14 11:17:17,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 50 [2023-02-14 11:17:17,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:17,968 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2023-02-14 11:17:17,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2023-02-14 11:17:18,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:17:18,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:17:18,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:18,126 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-02-14 11:17:18,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 86 [2023-02-14 11:17:18,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:18,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:18,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:18,144 INFO L321 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2023-02-14 11:17:18,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 76 [2023-02-14 11:17:18,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:18,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:18,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:18,178 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2023-02-14 11:17:18,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-02-14 11:17:19,030 INFO L321 Elim1Store]: treesize reduction 194, result has 10.2 percent of original size [2023-02-14 11:17:19,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 14 new quantified variables, introduced 21 case distinctions, treesize of input 251 treesize of output 121 [2023-02-14 11:17:19,049 INFO L321 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2023-02-14 11:17:19,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 34 [2023-02-14 11:17:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:17:19,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 11:17:19,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:19,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 133 [2023-02-14 11:17:19,182 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:19,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 112 [2023-02-14 11:17:19,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:19,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 219 [2023-02-14 11:17:19,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:19,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 198 [2023-02-14 11:17:19,788 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:19,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 363 treesize of output 349 [2023-02-14 11:17:19,796 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:19,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 328 [2023-02-14 11:17:20,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:20,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 177 [2023-02-14 11:17:20,309 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:20,310 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:20,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:20,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:20,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:20,361 INFO L321 Elim1Store]: treesize reduction 769, result has 2.7 percent of original size [2023-02-14 11:17:20,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 39134 treesize of output 35744 [2023-02-14 11:17:20,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:20,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35716 treesize of output 23846 [2023-02-14 11:17:20,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:20,432 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:20,433 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:20,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3560 treesize of output 3554 [2023-02-14 11:17:20,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3602 treesize of output 2636 [2023-02-14 11:17:20,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:20,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:20,491 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-02-14 11:17:20,491 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2596 treesize of output 2410 [2023-02-14 11:17:20,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:20,559 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 11:17:20,560 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 2276 treesize of output 1898 [2023-02-14 11:17:20,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1228 treesize of output 1098 [2023-02-14 11:17:20,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1089 treesize of output 977 [2023-02-14 11:17:20,628 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-14 11:17:20,628 INFO L350 Elim1Store]: Elim1 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 956 treesize of output 874 [2023-02-14 11:17:20,641 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:20,643 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:20,646 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:20,651 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-14 11:17:20,651 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 22 [2023-02-14 11:17:20,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:20,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 189 [2023-02-14 11:17:20,671 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:20,671 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:20,679 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-02-14 11:17:20,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2760 treesize of output 2680 [2023-02-14 11:17:20,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:17:20,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2676 treesize of output 1750 [2023-02-14 11:17:20,694 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:20,694 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:20,695 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:17:20,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:20,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:20,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:20,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:20,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3820 treesize of output 3622 [2023-02-14 11:17:20,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:20,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:20,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:20,733 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 3670 treesize of output 2608 [2023-02-14 11:17:20,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2568 treesize of output 2374 [2023-02-14 11:17:20,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2376 treesize of output 2278 [2023-02-14 11:17:20,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:20,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2320 treesize of output 2158 [2023-02-14 11:17:20,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:20,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2149 treesize of output 1681 [2023-02-14 11:17:20,822 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-14 11:17:20,822 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 31 [2023-02-14 11:17:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:17:20,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441424107] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 11:17:20,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 11:17:20,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 26 [2023-02-14 11:17:20,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456369337] [2023-02-14 11:17:20,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 11:17:20,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 11:17:20,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:17:20,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 11:17:20,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2023-02-14 11:17:20,870 INFO L87 Difference]: Start difference. First operand 106 states and 136 transitions. Second operand has 26 states, 26 states have (on average 5.269230769230769) internal successors, (137), 26 states have internal predecessors, (137), 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) [2023-02-14 11:17:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:17:22,531 INFO L93 Difference]: Finished difference Result 213 states and 265 transitions. [2023-02-14 11:17:22,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 11:17:22,532 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.269230769230769) internal successors, (137), 26 states have internal predecessors, (137), 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 64 [2023-02-14 11:17:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:17:22,533 INFO L225 Difference]: With dead ends: 213 [2023-02-14 11:17:22,533 INFO L226 Difference]: Without dead ends: 121 [2023-02-14 11:17:22,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2023-02-14 11:17:22,534 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 117 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-14 11:17:22,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1197 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-14 11:17:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-14 11:17:22,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2023-02-14 11:17:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.3) internal successors, (143), 110 states have internal predecessors, (143), 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) [2023-02-14 11:17:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 143 transitions. [2023-02-14 11:17:22,547 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 143 transitions. Word has length 64 [2023-02-14 11:17:22,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:17:22,547 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 143 transitions. [2023-02-14 11:17:22,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.269230769230769) internal successors, (137), 26 states have internal predecessors, (137), 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) [2023-02-14 11:17:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 143 transitions. [2023-02-14 11:17:22,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-14 11:17:22,548 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:17:22,548 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:17:22,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-14 11:17:22,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-14 11:17:22,749 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 11:17:22,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:17:22,749 INFO L85 PathProgramCache]: Analyzing trace with hash -377962859, now seen corresponding path program 8 times [2023-02-14 11:17:22,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:17:22,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267907982] [2023-02-14 11:17:22,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:17:22,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:17:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:17:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 23 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:17:24,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:17:24,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267907982] [2023-02-14 11:17:24,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267907982] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:17:24,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316452978] [2023-02-14 11:17:24,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 11:17:24,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:17:24,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:17:24,729 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 11:17:24,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-14 11:17:24,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 11:17:24,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 11:17:24,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 134 conjunts are in the unsatisfiable core [2023-02-14 11:17:24,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:17:24,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:24,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:24,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 11:17:24,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 11:17:24,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:17:24,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 11:17:24,998 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 11:17:24,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2023-02-14 11:17:25,022 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 11:17:25,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-14 11:17:25,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:17:25,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:17:25,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2023-02-14 11:17:25,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 11:17:25,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,145 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2023-02-14 11:17:25,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2023-02-14 11:17:25,154 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 32 [2023-02-14 11:17:25,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:17:25,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:17:25,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,308 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-14 11:17:25,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 83 [2023-02-14 11:17:25,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,330 INFO L321 Elim1Store]: treesize reduction 54, result has 38.6 percent of original size [2023-02-14 11:17:25,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 73 [2023-02-14 11:17:25,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-02-14 11:17:25,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2023-02-14 11:17:25,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:17:25,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 11:17:25,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,586 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-02-14 11:17:25,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 199 treesize of output 117 [2023-02-14 11:17:25,606 INFO L321 Elim1Store]: treesize reduction 43, result has 48.8 percent of original size [2023-02-14 11:17:25,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2023-02-14 11:17:25,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2023-02-14 11:17:25,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:17:25,652 INFO L321 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2023-02-14 11:17:25,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 36 [2023-02-14 11:17:28,436 INFO L321 Elim1Store]: treesize reduction 416, result has 54.4 percent of original size [2023-02-14 11:17:28,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 23 new quantified variables, introduced 78 case distinctions, treesize of input 495 treesize of output 689 [2023-02-14 11:17:29,202 INFO L321 Elim1Store]: treesize reduction 376, result has 54.0 percent of original size [2023-02-14 11:17:29,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 17 new quantified variables, introduced 78 case distinctions, treesize of input 575 treesize of output 799